About the Execution of GreatSPN+red for HouseConstruction-PT-00002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 565.787 | 15205.00 | 27026.00 | 234.20 | FTTFTFFFFFTFTTFT | normal |
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.r201-smll-171649586700147.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 greatspnxred
Input is HouseConstruction-PT-00002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586700147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00002-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716646599056
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:16:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 14:16:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:16:40] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-25 14:16:40] [INFO ] Transformed 26 places.
[2024-05-25 14:16:41] [INFO ] Transformed 18 transitions.
[2024-05-25 14:16:41] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-00002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 15 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 14:16:41] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 14:16:41] [INFO ] Implicit Places using invariants in 211 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 264 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 23 out of 25 places after structural reductions.
[2024-05-25 14:16:41] [INFO ] Flatten gal took : 21 ms
[2024-05-25 14:16:41] [INFO ] Flatten gal took : 7 ms
[2024-05-25 14:16:41] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40003 steps (739 resets) in 1075 ms. (37 steps per ms) remains 5/33 properties
BEST_FIRST walk for 40003 steps (391 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (331 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (392 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (339 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (355 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 14:16:42] [INFO ] Computed 7 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 43/43 variables, and 32 constraints, problems are : Problem set: 5 solved, 0 unsolved in 194 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA HouseConstruction-PT-00002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/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)&&X(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:16:43] [INFO ] Implicit Places using invariants in 47 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-00
Stuttering criterion allowed to conclude after 57 steps with 4 reset in 2 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-00 finished in 461 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)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 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 3 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 10 transition count 6
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 7 place count 9 transition count 6
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 9 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 7 transition count 4
Applied a total of 10 rules in 25 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-25 14:16:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 14:16:43] [INFO ] Implicit Places using invariants in 39 ms returned [1, 3, 5]
[2024-05-25 14:16:43] [INFO ] Actually due to overlaps returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/25 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-01
Product exploration explored 100000 steps with 12191 reset in 369 ms.
Product exploration explored 100000 steps with 12202 reset in 169 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00002-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLCardinality-01 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(!p0)))||G(p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:16:44] [INFO ] Implicit Places using invariants in 40 ms returned [9, 13]
[2024-05-25 14:16:44] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 14:16:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 14:16:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 14:16:44] [INFO ] Invariant cache hit.
[2024-05-25 14:16:44] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 239 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-02
Product exploration explored 100000 steps with 4879 reset in 125 ms.
Product exploration explored 100000 steps with 4877 reset in 103 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 147 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 14:16:46] [INFO ] Invariant cache hit.
[2024-05-25 14:16:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 14:16:46] [INFO ] Invariant cache hit.
[2024-05-25 14:16:46] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-25 14:16:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 262 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 581ms
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 134 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4904 reset in 85 ms.
Product exploration explored 100000 steps with 4888 reset in 94 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 19 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 18 /22 variables (removed 4) and now considering 15/18 (removed 3) transitions.
[2024-05-25 14:16:48] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 18 cols
[2024-05-25 14:16:48] [INFO ] Computed 3 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 2 (OVERLAPS) 15/32 variables, 17/20 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/20 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/21 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 21 constraints, problems are : Problem set: 7 solved, 7 unsolved in 147 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/29 variables, 14/17 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 7/24 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 4/33 variables, 4/28 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/28 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 28 constraints, problems are : Problem set: 7 solved, 7 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 7 solved, 7 unsolved
Search for dead transitions found 7 dead transitions in 271ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 8/18 transitions.
Graph (complete) has 11 edges and 18 vertex of which 11 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 8 /18 variables (removed 10) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 295 ms. Remains : 8/22 places, 8/18 transitions.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 14:16:48] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 14:16:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 14:16:48] [INFO ] Invariant cache hit.
[2024-05-25 14:16:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-25 14:16:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 225 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 248 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 481ms
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00002-LTLCardinality-02 finished in 4935 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&&X(G(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:49] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:16:49] [INFO ] Implicit Places using invariants in 43 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-03 finished in 181 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)) U (F((p1&&F(!p0))) U (F(p2) U p3))))'
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 14:16:49] [INFO ] Invariant cache hit.
[2024-05-25 14:16:49] [INFO ] Implicit Places using invariants in 32 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p3), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p3), (AND (NOT p2) p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (F (G (NOT p3))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X p3))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 19 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00002-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLCardinality-04 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 14:16:50] [INFO ] Invariant cache hit.
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 29 ms returned [9, 13]
[2024-05-25 14:16:50] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 14:16:50] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 14:16:50] [INFO ] Invariant cache hit.
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-05 finished in 201 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((X(p0)&&G((p1&&F(!p0))))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 33 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, true, true, (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-06
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-06 finished in 283 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) U p1))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 14:16:50] [INFO ] Invariant cache hit.
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 13]
[2024-05-25 14:16:50] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 14:16:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 14:16:50] [INFO ] Invariant cache hit.
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-08 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:16:50] [INFO ] Implicit Places using invariants in 38 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-09 finished in 185 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 X(G(p0)))||(F(G(p1))&&(!p0 U (p2||G(!p0))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 14:16:51] [INFO ] Invariant cache hit.
[2024-05-25 14:16:51] [INFO ] Implicit Places using invariants in 36 ms returned [9, 13]
[2024-05-25 14:16:51] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 14:16:51] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 14:16:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 14:16:51] [INFO ] Invariant cache hit.
[2024-05-25 14:16:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p2)), true]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 46 steps with 1 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-11 finished in 424 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(p0) U p1)&&X((p1 U p2))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:51] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 14:16:51] [INFO ] Implicit Places using invariants in 33 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 124 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00002-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLCardinality-12 finished in 522 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 16 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 14 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 13 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 8 transition count 5
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 15 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
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 4 transition count 4
Applied a total of 19 rules in 3 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 14:16:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 14:16:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 14:16:52] [INFO ] Invariant cache hit.
[2024-05-25 14:16:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 14:16:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 14:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-13
Product exploration explored 100000 steps with 11111 reset in 67 ms.
Product exploration explored 100000 steps with 11111 reset in 243 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00002-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLCardinality-13 finished in 534 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))||G(!p0)) U G(p1)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:16:52] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 14:16:52] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13]
[2024-05-25 14:16:52] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 0 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 14:16:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 14:16:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 14:16:52] [INFO ] Invariant cache hit.
[2024-05-25 14:16:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p0), false, false, (AND (NOT p1) (NOT p0)), true, p0, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1393 steps with 461 reset in 2 ms.
FORMULA HouseConstruction-PT-00002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLCardinality-14 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(!p0)))||G(p1))))'
[2024-05-25 14:16:53] [INFO ] Flatten gal took : 5 ms
[2024-05-25 14:16:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 14:16:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 49 arcs took 5 ms.
Total runtime 12399 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running HouseConstruction-PT-00002
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 25
TRANSITIONS: 18
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1186
MODEL NAME: /home/mcc/execution/413/model
25 places, 18 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA HouseConstruction-PT-00002-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716646614261
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="HouseConstruction-PT-00002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HouseConstruction-PT-00002, 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 r201-smll-171649586700147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00002.tgz
mv HouseConstruction-PT-00002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;