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.r202-smll-171649588100379.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 itstools
Input is IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588100379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 60K 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-C05M04P03D02-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716781923010

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 03:52:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 03:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 03:52:05] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-27 03:52:05] [INFO ] Transformed 111 places.
[2024-05-27 03:52:05] [INFO ] Transformed 45 transitions.
[2024-05-27 03:52:05] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 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 29 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 77 transition count 45
Applied a total of 34 rules in 35 ms. Remains 77 /111 variables (removed 34) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 77 cols
[2024-05-27 03:52:05] [INFO ] Computed 33 invariants in 18 ms
[2024-05-27 03:52:06] [INFO ] Implicit Places using invariants in 519 ms returned [10, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 567 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 75/111 places, 45/45 transitions.
Support contains 39 out of 75 places after structural reductions.
[2024-05-27 03:52:06] [INFO ] Flatten gal took : 49 ms
[2024-05-27 03:52:06] [INFO ] Flatten gal took : 19 ms
[2024-05-27 03:52:06] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 36 out of 75 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1981 ms. (20 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 346 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
// Phase 1: matrix 45 rows 75 cols
[2024-05-27 03:52:07] [INFO ] Computed 31 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/40 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/50 variables, 7/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 73/120 variables, and 29 constraints, problems are : Problem set: 3 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 9 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:52:08] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 03:52:08] [INFO ] Implicit Places using invariants in 105 ms returned [13, 15, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 106 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 45/45 transitions.
Applied a total of 0 rules in 6 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 122 ms. Remains : 62/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 finished in 513 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(p0))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 25 rules applied. Total rules applied 37 place count 50 transition count 26
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 47 place count 40 transition count 26
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 47 place count 40 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 71 place count 25 transition count 17
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 1 rules applied. Total rules applied 72 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 24 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 73 place count 24 transition count 13
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 79 place count 21 transition count 13
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 97 place count 10 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 98 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 101 place count 7 transition count 5
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 6 with 1 rules applied. Total rules applied 102 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 104 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 104 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 106 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 8 with 3 rules applied. Total rules applied 109 place count 2 transition count 2
Applied a total of 109 rules in 31 ms. Remains 2 /75 variables (removed 73) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-27 03:52:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 03:52:08] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-27 03:52:08] [INFO ] Invariant cache hit.
[2024-05-27 03:52:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-27 03:52:08] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-27 03:52:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[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 82ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/75 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 2/75 places, 2/45 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
Product exploration explored 100000 steps with 9971 reset in 287 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 finished in 528 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(p0) U (G(!p0) U p1)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 50 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 49 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 67 place count 28 transition count 18
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 1 rules applied. Total rules applied 68 place count 28 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 27 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 69 place count 27 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 26 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 88 place count 16 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 15 transition count 9
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 98 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 99 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 100 place count 8 transition count 5
Applied a total of 100 rules in 13 ms. Remains 8 /75 variables (removed 67) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-05-27 03:52:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 03:52:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 03:52:09] [INFO ] Invariant cache hit.
[2024-05-27 03:52:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-27 03:52:09] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-27 03:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/75 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 8/75 places, 5/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
Product exploration explored 100000 steps with 11744 reset in 130 ms.
Product exploration explored 100000 steps with 11654 reset in 200 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
[2024-05-27 03:52:10] [INFO ] Invariant cache hit.
[2024-05-27 03:52:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 03:52:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 03:52:10] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-27 03:52:10] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 03:52:10] [INFO ] Added : 2 causal constraints over 1 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-27 03:52:10] [INFO ] Invariant cache hit.
[2024-05-27 03:52:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 03:52:10] [INFO ] Invariant cache hit.
[2024-05-27 03:52:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-27 03:52:10] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-27 03:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 8/8 places, 5/5 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
[2024-05-27 03:52:11] [INFO ] Invariant cache hit.
[2024-05-27 03:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 03:52:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 03:52:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 03:52:11] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 03:52:11] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11647 reset in 136 ms.
Product exploration explored 100000 steps with 11706 reset in 118 ms.
Built C files in :
/tmp/ltsmin8802395868955952375
[2024-05-27 03:52:11] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-27 03:52:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:11] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-27 03:52:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:11] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-27 03:52:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8802395868955952375
Running compilation step : cd /tmp/ltsmin8802395868955952375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 357 ms.
Running link step : cd /tmp/ltsmin8802395868955952375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin8802395868955952375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7639315056417250097.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 finished in 2889 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' '!(((p0 U p1)||F(p2)||G(p3)))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 53 transition count 31
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 46 transition count 29
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 42 place count 43 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 42 transition count 28
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 43 place count 42 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 58 place count 33 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 58 place count 33 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 32 transition count 21
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 74 place count 24 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 24 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 76 place count 23 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 79 place count 21 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 80 place count 21 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 82 place count 19 transition count 12
Applied a total of 82 rules in 13 ms. Remains 19 /75 variables (removed 56) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 19 cols
[2024-05-27 03:52:12] [INFO ] Computed 8 invariants in 1 ms
[2024-05-27 03:52:12] [INFO ] Implicit Places using invariants in 84 ms returned [3, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/75 places, 12/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 17/75 places, 12/45 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
Product exploration explored 100000 steps with 4675 reset in 137 ms.
Product exploration explored 100000 steps with 4636 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 194 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 9 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 335 ms. (119 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
// Phase 1: matrix 12 rows 17 cols
[2024-05-27 03:52:13] [INFO ] Computed 6 invariants in 1 ms
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 27 factoid took 572 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 430 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 438 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
[2024-05-27 03:52:15] [INFO ] Invariant cache hit.
[2024-05-27 03:52:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-27 03:52:15] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 03:52:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 03:52:15] [INFO ] Computed and/alt/rep : 11/12/11 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 03:52:15] [INFO ] Added : 7 causal constraints over 2 iterations in 75 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-27 03:52:15] [INFO ] Invariant cache hit.
[2024-05-27 03:52:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 03:52:15] [INFO ] Invariant cache hit.
[2024-05-27 03:52:15] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-27 03:52:15] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-27 03:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 481 ms. Remains : 17/17 places, 12/12 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 : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 176 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 410 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
RANDOM walk for 40001 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-05-27 03:52:16] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p2), (F (NOT (OR p0 p2))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 22 factoid took 580 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 402 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
[2024-05-27 03:52:17] [INFO ] Invariant cache hit.
[2024-05-27 03:52:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-27 03:52:17] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-27 03:52:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-27 03:52:17] [INFO ] Computed and/alt/rep : 11/12/11 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 03:52:17] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 4665 reset in 105 ms.
Product exploration explored 100000 steps with 4652 reset in 135 ms.
Built C files in :
/tmp/ltsmin2775133134236070185
[2024-05-27 03:52:18] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-27 03:52:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:18] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-27 03:52:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:18] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-27 03:52:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 03:52:18] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2775133134236070185
Running compilation step : cd /tmp/ltsmin2775133134236070185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin2775133134236070185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2775133134236070185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1094076953698725895.hoa' '--buchi-type=spotba'
LTSmin run took 75 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 finished in 6644 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' '!(G(F((G(p0)||(p1&&X(p2))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 45
Applied a total of 9 rules in 4 ms. Remains 66 /75 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2024-05-27 03:52:18] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 03:52:18] [INFO ] Implicit Places using invariants in 101 ms returned [14, 16, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 102 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 63/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
Product exploration explored 100000 steps with 5 reset in 154 ms.
Product exploration explored 100000 steps with 2 reset in 221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 135 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40001 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/3 properties
// Phase 1: matrix 45 rows 63 cols
[2024-05-27 03:52:19] [INFO ] Computed 19 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 44/108 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/16 constraints, Generalized P Invariants (flows): 1/3 constraints, State Equation: 0/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 24 factoid took 724 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 03:52:20] [INFO ] Invariant cache hit.
[2024-05-27 03:52:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 03:52:20] [INFO ] Invariant cache hit.
[2024-05-27 03:52:21] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 03:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 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/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2563ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2565ms
Finished structural reductions in LTL mode , in 1 iterations and 2780 ms. Remains : 63/63 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 : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 180 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/10 properties
BEST_FIRST walk for 1263 steps (0 resets) in 4 ms. (252 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F p1)]
Knowledge based reduction with 21 factoid took 559 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 3 reset in 206 ms.
Built C files in :
/tmp/ltsmin15866766691586471007
[2024-05-27 03:52:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15866766691586471007
Running compilation step : cd /tmp/ltsmin15866766691586471007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 301 ms.
Running link step : cd /tmp/ltsmin15866766691586471007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15866766691586471007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12973185915726455369.hoa' '--buchi-type=spotba'
LTSmin run took 3448 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 finished in 10862 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 50 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 39 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 49 place count 39 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 70 place count 26 transition count 17
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 1 rules applied. Total rules applied 71 place count 26 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 25 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 72 place count 25 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 23 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 90 place count 15 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 91 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 94 place count 12 transition count 7
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 6 with 1 rules applied. Total rules applied 95 place count 12 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 97 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 97 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 100 place count 8 transition count 5
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 8 with 3 rules applied. Total rules applied 103 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 104 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 106 place count 4 transition count 3
Applied a total of 106 rules in 8 ms. Remains 4 /75 variables (removed 71) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-27 03:52:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 03:52:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-27 03:52:29] [INFO ] Invariant cache hit.
[2024-05-27 03:52:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-27 03:52:29] [INFO ] Redundant transitions in 1 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-27 03:52:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/75 places, 3/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 4/75 places, 3/45 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 58 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 finished in 229 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' '!(G((X((!p1 U (G(!p1)||(!p1&&G(p2)))))||p0)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 45
Applied a total of 9 rules in 4 ms. Remains 66 /75 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2024-05-27 03:52:29] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 03:52:29] [INFO ] Implicit Places using invariants in 63 ms returned [13, 15, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 63/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) p1), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 finished in 401 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 20 rules applied. Total rules applied 30 place count 53 transition count 30
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 45 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 44 transition count 29
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 40 place count 44 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 62 place count 30 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 62 place count 30 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 68 place count 27 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 85 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 15 transition count 10
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 6 with 3 rules applied. Total rules applied 91 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 92 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 93 place count 12 transition count 8
Applied a total of 93 rules in 10 ms. Remains 12 /75 variables (removed 63) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-27 03:52:30] [INFO ] Computed 5 invariants in 0 ms
[2024-05-27 03:52:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 03:52:30] [INFO ] Invariant cache hit.
[2024-05-27 03:52:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-27 03:52:30] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-27 03:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/75 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 12/75 places, 8/45 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
Product exploration explored 100000 steps with 3 reset in 193 ms.
Stack based approach found an accepted trace after 46 steps with 1 reset with depth 39 and stack size 39 in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 finished in 629 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((p0||G((F(p1)&&F(!p0))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 45
Applied a total of 9 rules in 6 ms. Remains 66 /75 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2024-05-27 03:52:30] [INFO ] Computed 22 invariants in 0 ms
[2024-05-27 03:52:30] [INFO ] Implicit Places using invariants in 85 ms returned [15, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 64/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 finished in 529 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||X(p1)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 3 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:52:31] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 03:52:31] [INFO ] Implicit Places using invariants in 60 ms returned [13, 15, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 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 69 ms. Remains : 62/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 185 ms.
Stack based approach found an accepted trace after 28202 steps with 0 reset with depth 28203 and stack size 27676 in 70 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 finished in 424 ms.
All properties solved by simple procedures.
Total runtime 26900 ms.

BK_STOP 1716781951882

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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