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-171649588000372.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-C03M03P03D03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588000372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.4K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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-C03M03P03D03-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716781699930

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C03M03P03D03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 03:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 03:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 03:48:22] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-27 03:48:22] [INFO ] Transformed 111 places.
[2024-05-27 03:48:22] [INFO ] Transformed 45 transitions.
[2024-05-27 03:48:22] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 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 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 88 transition count 45
Applied a total of 23 rules in 50 ms. Remains 88 /111 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 88 cols
[2024-05-27 03:48:23] [INFO ] Computed 44 invariants in 29 ms
[2024-05-27 03:48:23] [INFO ] Implicit Places using invariants in 442 ms returned [13, 21, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 509 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 85/111 places, 45/45 transitions.
Support contains 53 out of 85 places after structural reductions.
[2024-05-27 03:48:24] [INFO ] Flatten gal took : 44 ms
[2024-05-27 03:48:24] [INFO ] Flatten gal took : 16 ms
[2024-05-27 03:48:24] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 52 out of 85 places (down from 53) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 20
RANDOM walk for 3931 steps (0 resets) in 319 ms. (12 steps per ms) remains 0/20 properties
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((!p2 U (p3||G(!p2)))||p1)&&p0))))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 39
Reduce places removed 10 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 17 rules applied. Total rules applied 27 place count 55 transition count 32
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 48 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 48 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 58 place count 34 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 34 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 32 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 74 place count 25 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 24 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 24 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 23 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 82 place count 20 transition count 12
Applied a total of 82 rules in 42 ms. Remains 20 /85 variables (removed 65) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-27 03:48:24] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 03:48:24] [INFO ] Implicit Places using invariants in 59 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/85 places, 12/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 18/85 places, 12/45 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 700 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 finished in 1207 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(p1))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 4 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-27 03:48:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-27 03:48:26] [INFO ] Implicit Places using invariants in 128 ms returned [15, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G((p1 U p2)))&&p0))))'
Support contains 11 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 12 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 70 transition count 45
Applied a total of 15 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 70 cols
[2024-05-27 03:48:26] [INFO ] Computed 26 invariants in 1 ms
[2024-05-27 03:48:26] [INFO ] Implicit Places using invariants in 93 ms returned [17, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/85 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 68/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (p1||G(!p0))))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 10 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-27 03:48:26] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 03:48:26] [INFO ] Implicit Places using invariants in 145 ms returned [15, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 finished in 1130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F((!p1||G(F(!p1))))))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 7 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:48:27] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 03:48:27] [INFO ] Implicit Places using invariants in 108 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 5 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 122 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 167 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 p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 finished in 756 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(G((p0||F(p1))))||(X(p3)&&p2))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 4 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-27 03:48:28] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 03:48:28] [INFO ] Implicit Places using invariants in 83 ms returned [16, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
Product exploration explored 100000 steps with 5192 reset in 151 ms.
Product exploration explored 100000 steps with 5199 reset in 245 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 p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
Knowledge based reduction with 12 factoid took 383 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 82 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:48:30] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 03:48:30] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-27 03:48:30] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-27 03:48:30] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-27 03:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:48:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-27 03:48:31] [INFO ] [Nat]Absence check using 16 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-27 03:48:31] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-27 03:48:31] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 03:48:31] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 03:48:31] [INFO ] Invariant cache hit.
[2024-05-27 03:48:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 03:48:31] [INFO ] Invariant cache hit.
[2024-05-27 03:48:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 03:48:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/110 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 86 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 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/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/110 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 44/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 130 constraints, problems are : Problem set: 0 solved, 44 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2296ms
Finished structural reductions in LTL mode , in 1 iterations and 2497 ms. Remains : 65/65 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 82 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-27 03:48:34] [INFO ] Invariant cache hit.
[2024-05-27 03:48:34] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-27 03:48:34] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-27 03:48:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-27 03:48:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:48:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-27 03:48:34] [INFO ] [Nat]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-27 03:48:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-27 03:48:34] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 03:48:34] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5212 reset in 205 ms.
Product exploration explored 100000 steps with 5182 reset in 253 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 7 place count 65 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 20 place count 65 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 65 transition count 45
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 26 rules in 18 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 03:48:35] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:48:35] [INFO ] Computed 21 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 37 ms of which 7 ms to minimize.
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/27 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 2/29 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/30 constraints. Problems are: Problem set: 9 solved, 35 unsolved
[2024-05-27 03:48:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/31 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 35 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 8 (OVERLAPS) 45/110 variables, 65/96 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/96 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/96 constraints. Problems are: Problem set: 26 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 96 constraints, problems are : Problem set: 26 solved, 18 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 26 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/5 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 10/15 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 26/64 variables, 13/28 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/30 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/31 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 45/110 variables, 65/96 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 18/114 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/114 constraints. Problems are: Problem set: 26 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/114 constraints. Problems are: Problem set: 26 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 114 constraints, problems are : Problem set: 26 solved, 18 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 18/44 constraints, Known Traps: 10/10 constraints]
After SMT, in 1863ms problems are : Problem set: 26 solved, 18 unsolved
Search for dead transitions found 26 dead transitions in 1865ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 19/45 transitions.
Graph (complete) has 78 edges and 65 vertex of which 39 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 29 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 29 transition count 19
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 27 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 27 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 27 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 26 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 26 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 16 rules in 9 ms. Remains 26 /65 variables (removed 39) and now considering 16/19 (removed 3) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/65 places, 16/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1901 ms. Remains : 26/65 places, 16/45 transitions.
Built C files in :
/tmp/ltsmin17701468330115853827
[2024-05-27 03:48:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17701468330115853827
Running compilation step : cd /tmp/ltsmin17701468330115853827;'/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 431 ms.
Running link step : cd /tmp/ltsmin17701468330115853827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17701468330115853827;'/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/stateBased5646496291711136669.hoa' '--buchi-type=spotba'
LTSmin run took 6108 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 finished in 15851 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 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 4 places :
Implicit places reduction removed 4 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 13 rules applied. Total rules applied 13 place count 64 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 49 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 37 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 52 place count 37 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 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 3 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 3 with 2 rules applied. Total rules applied 71 place count 26 transition count 16
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 3 with 14 rules applied. Total rules applied 85 place count 18 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 17 transition count 9
Applied a total of 87 rules in 8 ms. Remains 17 /85 variables (removed 68) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 17 cols
[2024-05-27 03:48:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants in 46 ms returned [1, 2, 5, 7]
[2024-05-27 03:48:44] [INFO ] Actually due to overlaps returned [7, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/85 places, 9/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 6
Applied a total of 6 rules in 3 ms. Remains 11 /14 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 11 cols
[2024-05-27 03:48:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants in 24 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/85 places, 6/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 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 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 7 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 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /10 variables (removed 4) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-27 03:48:44] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 03:48:44] [INFO ] Invariant cache hit.
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/85 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 126 ms. Remains : 6/85 places, 4/45 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 121 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-C03M03P03D03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U (F(G(p1)) U p2))))))'
Support contains 10 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 3 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-27 03:48:44] [INFO ] Computed 23 invariants in 5 ms
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 03:48:44] [INFO ] Invariant cache hit.
[2024-05-27 03:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:48:44] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 03:48:44] [INFO ] Invariant cache hit.
[2024-05-27 03:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 91 constraints, problems are : Problem set: 0 solved, 44 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 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/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/112 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 135 constraints, problems are : Problem set: 0 solved, 44 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1930ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1932ms
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2109 ms. Remains : 67/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 506 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 259 steps with 0 reset with depth 260 and stack size 260 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 finished in 2790 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&&X(F(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 1 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-27 03:48:47] [INFO ] Computed 21 invariants in 15 ms
[2024-05-27 03:48:47] [INFO ] Implicit Places using invariants in 83 ms returned [14, 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 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 1 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 87 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-15
Product exploration explored 100000 steps with 1198 reset in 121 ms.
Product exploration explored 100000 steps with 1187 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 358 steps (0 resets) in 8 ms. (39 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2024-05-27 03:48:48] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-27 03:48:48] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 03:48:48] [INFO ] Added : 24 causal constraints over 5 iterations in 65 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-27 03:48:48] [INFO ] Invariant cache hit.
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 03:48:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-27 03:48:48] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 03:48:48] [INFO ] Added : 32 causal constraints over 7 iterations in 96 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 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 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 03:48:48] [INFO ] Invariant cache hit.
[2024-05-27 03:48:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-27 03:48:48] [INFO ] Invariant cache hit.
[2024-05-27 03:48:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 03:48:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/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 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 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, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/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 797 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2155ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2159ms
Finished structural reductions in LTL mode , in 1 iterations and 2335 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 (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 361 steps (0 resets) in 7 ms. (45 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-27 03:48:51] [INFO ] Invariant cache hit.
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 03:48:51] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 03:48:51] [INFO ] Added : 24 causal constraints over 5 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-27 03:48:51] [INFO ] Invariant cache hit.
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 03:48:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 03:48:51] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 03:48:51] [INFO ] Added : 32 causal constraints over 7 iterations in 78 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1191 reset in 192 ms.
Product exploration explored 100000 steps with 1192 reset in 231 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 23 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 31 rules in 20 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2024-05-27 03:48:52] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2024-05-27 03:48:52] [INFO ] Computed 19 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 37 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 46 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 41 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-27 03:48:53] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 13/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 94 constraints, problems are : Problem set: 28 solved, 15 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 28 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 10/10 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 30/61 variables, 14/24 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 4/28 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/31 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 44/106 variables, 62/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 15/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 109 constraints, problems are : Problem set: 28 solved, 15 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 15/43 constraints, Known Traps: 13/13 constraints]
After SMT, in 1752ms problems are : Problem set: 28 solved, 15 unsolved
Search for dead transitions found 28 dead transitions in 1754ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 16/45 transitions.
Graph (complete) has 73 edges and 62 vertex of which 34 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 22 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 22 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 22 transition count 16
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 17 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 17 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 21 rules in 5 ms. Remains 17 /62 variables (removed 45) and now considering 11/16 (removed 5) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/63 places, 11/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1788 ms. Remains : 17/63 places, 11/45 transitions.
Built C files in :
/tmp/ltsmin14705858044822314776
[2024-05-27 03:48:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14705858044822314776
Running compilation step : cd /tmp/ltsmin14705858044822314776;'/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 304 ms.
Running link step : cd /tmp/ltsmin14705858044822314776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14705858044822314776;'/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/stateBased4374002119673849731.hoa' '--buchi-type=spotba'
LTSmin run took 491 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 finished in 7944 ms.
All properties solved by simple procedures.
Total runtime 33034 ms.

BK_STOP 1716781735533

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="LTLFireability"
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-C03M03P03D03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649588000372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;