fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654406700555
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Philosophers-PT-005000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16010.220 2705281.00 4782304.00 6501.10 ??F???????T?FFF? 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.r267-smll-171654406700555.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 Philosophers-PT-005000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406700555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 162M
-rw-r--r-- 1 mcc users 5.5M Apr 13 19:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27M Apr 13 19:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Apr 13 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 13 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2M Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 7.8M Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0M Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11M Apr 14 03:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54M Apr 14 03:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Apr 13 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 501K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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 Philosophers-PT-005000-LTLCardinality-00
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-01
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-02
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-03
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-04
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-05
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-06
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-07
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-08
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-09
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-10
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-11
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-12
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-13
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-14
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716959285149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-005000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 05:08:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 05:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:08:08] [INFO ] Load time of PNML (sax parser for PT used): 1120 ms
[2024-05-29 05:08:08] [INFO ] Transformed 25000 places.
[2024-05-29 05:08:08] [INFO ] Transformed 25000 transitions.
[2024-05-29 05:08:08] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 1453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 433 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-005000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 194 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2024-05-29 05:08:10] [INFO ] Computed 10000 invariants in 263 ms
[2024-05-29 05:08:28] [INFO ] Implicit Places using invariants in 17964 ms returned []
Implicit Place search using SMT only with invariants took 18039 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:08:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30818 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
SMT process timed out in 99445ms, After SMT, problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 99745ms
Finished structural reductions in LTL mode , in 1 iterations and 118222 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2024-05-29 05:10:10] [INFO ] Flatten gal took : 1249 ms
[2024-05-29 05:10:12] [INFO ] Flatten gal took : 1055 ms
[2024-05-29 05:10:14] [INFO ] Input system was already deterministic with 25000 transitions.
RANDOM walk for 29469 steps (8 resets) in 120014 ms. (0 steps per ms) remains 15/27 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2624 ms. (1 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 3810 ms. (1 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 3666 ms. (1 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 5381 ms. (0 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2714 ms. (1 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1104 ms. (3 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 883 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 918 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 859 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 880 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 713 ms. (5 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1135 ms. (3 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1019 ms. (3 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 999 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (0 resets) in 973 ms. (4 steps per ms) remains 15/15 properties
[2024-05-29 05:10:53] [INFO ] Invariant cache hit.
SMT process timed out in 10715ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 276 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 25000/25000 places, 25000/25000 transitions.
RANDOM walk for 29418 steps (8 resets) in 120009 ms. (0 steps per ms) remains 13/15 properties
BEST_FIRST walk for 32004 steps (0 resets) in 20582 ms. (1 steps per ms) remains 13/13 properties
BEST_FIRST walk for 27004 steps (0 resets) in 21973 ms. (1 steps per ms) remains 13/13 properties
BEST_FIRST walk for 28004 steps (0 resets) in 21461 ms. (1 steps per ms) remains 13/13 properties
BEST_FIRST walk for 20004 steps (0 resets) in 21317 ms. (0 steps per ms) remains 13/13 properties
BEST_FIRST walk for 37004 steps (0 resets) in 21143 ms. (1 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 11940 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 9729 ms. (4 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 10341 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 10618 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 11411 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 10423 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 9975 ms. (4 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (0 resets) in 10587 ms. (3 steps per ms) remains 13/13 properties
[2024-05-29 05:12:24] [INFO ] Invariant cache hit.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/25000 variables, 10000/10000 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 8 solved, 5 unsolved in 45232 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25000 variables, 10000/10000 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 8 solved, 5 unsolved in 45246 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 99286ms problems are : Problem set: 8 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 396 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-005000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((p0||F(p1)))))))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 5336 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:14:09] [INFO ] Invariant cache hit.
[2024-05-29 05:14:56] [INFO ] Performed 6774/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:15:26] [INFO ] Performed 19635/25000 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-29 05:15:29] [INFO ] Implicit Places using invariants in 79927 ms returned []
Implicit Place search using SMT only with invariants took 79928 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:15:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30445 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30421 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 110627ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 110864ms
Finished structural reductions in LTL mode , in 1 iterations and 196216 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-005000-LTLCardinality-00
Product exploration timeout after 5860 steps with 1468 reset in 10007 ms.
Product exploration timeout after 6140 steps with 1519 reset in 10049 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 91298 ms. (0 steps per ms) remains 2/3 properties
BEST_FIRST walk for 22004 steps (0 resets) in 21370 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 29004 steps (0 resets) in 21167 ms. (1 steps per ms) remains 2/2 properties
[2024-05-29 05:18:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 9523ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 25000 transition count 20000
Reduce places removed 5000 places and 0 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 12213 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12214 ms. Remains : 20000/25000 places, 20000/25000 transitions.
RANDOM walk for 13337 steps (3 resets) in 22106 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 3316 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:19:01] [INFO ] Invariant cache hit.
[2024-05-29 05:19:45] [INFO ] Performed 7594/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:20:10] [INFO ] Implicit Places using invariants in 68991 ms returned []
Implicit Place search using SMT only with invariants took 69002 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30350 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30307 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 104492ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 104654ms
Finished structural reductions in LTL mode , in 1 iterations and 177011 ms. Remains : 25000/25000 places, 25000/25000 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) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 97800 ms. (0 steps per ms) remains 2/3 properties
BEST_FIRST walk for 24004 steps (0 resets) in 20657 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 28004 steps (0 resets) in 20654 ms. (1 steps per ms) remains 2/2 properties
[2024-05-29 05:22:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 9479ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 25000 transition count 20000
Reduce places removed 5000 places and 0 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 12305 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12310 ms. Remains : 20000/25000 places, 20000/25000 transitions.
RANDOM walk for 20002 steps (4 resets) in 34077 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration timeout after 5950 steps with 1516 reset in 10008 ms.
Product exploration timeout after 5720 steps with 1418 reset in 10055 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 3418 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30352 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30285 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 112702ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 112883ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116333 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 3193 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:25:36] [INFO ] Invariant cache hit.
[2024-05-29 05:26:23] [INFO ] Performed 6689/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:26:50] [INFO ] Implicit Places using invariants in 74547 ms returned []
Implicit Place search using SMT only with invariants took 74553 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:26:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30335 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30246 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 97675ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 97923ms
Finished structural reductions in LTL mode , in 1 iterations and 175706 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLCardinality-00 finished in 866429 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)) U p0))'
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2752 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:28:33] [INFO ] Invariant cache hit.
[2024-05-29 05:29:16] [INFO ] Performed 9124/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:29:46] [INFO ] Performed 18493/25000 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-29 05:29:51] [INFO ] Implicit Places using invariants in 77547 ms returned []
Implicit Place search using SMT only with invariants took 77548 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:29:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30326 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30248 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 100104ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 100354ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 180676 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), p0]
Running random walk in product with property : Philosophers-PT-005000-LTLCardinality-01
Product exploration timeout after 6250 steps with 0 reset in 10003 ms.
Product exploration timeout after 6210 steps with 0 reset in 10007 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), p0]
RANDOM walk for 811 steps (0 resets) in 2141 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), p0]
[2024-05-29 05:32:09] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2314 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:32:18] [INFO ] Invariant cache hit.
[2024-05-29 05:33:02] [INFO ] Performed 9260/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:33:32] [INFO ] Performed 17411/25000 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-29 05:33:42] [INFO ] Implicit Places using invariants in 84643 ms returned []
Implicit Place search using SMT only with invariants took 84645 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:33:42] [INFO ] Invariant cache hit.
SMT process timed out in 72805ms, After SMT, problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 72949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 159928 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), p0]
RANDOM walk for 742 steps (0 resets) in 2158 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), p0]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), p0]
[2024-05-29 05:35:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), p0]
Product exploration timeout after 5730 steps with 0 reset in 10009 ms.
Product exploration timeout after 5990 steps with 0 reset in 10004 ms.
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2222 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:35:43] [INFO ] Invariant cache hit.
[2024-05-29 05:36:28] [INFO ] Performed 8017/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:36:58] [INFO ] Performed 17621/25000 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-29 05:37:04] [INFO ] Implicit Places using invariants in 80825 ms returned []
Implicit Place search using SMT only with invariants took 80831 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:37:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30324 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30253 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 99479ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 99653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182728 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLCardinality-01 finished in 615042 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))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 874 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:38:46] [INFO ] Invariant cache hit.
[2024-05-29 05:39:32] [INFO ] Performed 14113/25000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-29 05:39:35] [INFO ] Implicit Places using invariants in 48618 ms returned []
Implicit Place search using SMT only with invariants took 48620 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:39:35] [INFO ] Invariant cache hit.
SMT process timed out in 71627ms, After SMT, problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 71775ms
Finished structural reductions in LTL mode , in 1 iterations and 121292 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-005000-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA Philosophers-PT-005000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-005000-LTLCardinality-02 finished in 121462 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||G(p1)))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 187 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-29 05:40:47] [INFO ] Invariant cache hit.
[2024-05-29 05:41:21] [INFO ] Implicit Places using invariants in 34411 ms returned []
Implicit Place search using SMT only with invariants took 34421 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-29 05:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30346 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30276 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 100731ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 101036ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 135673 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-005000-LTLCardinality-03
Product exploration timeout after 3080 steps with 0 reset in 10014 ms.
Product exploration timeout after 3070 steps with 0 reset in 10026 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 p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 37635 steps (8 resets) in 120006 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 16004 steps (0 resets) in 22206 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 27004 steps (0 resets) in 21697 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 20004 steps (0 resets) in 21162 ms. (0 steps per ms) remains 3/3 properties
Probabilistic random walk after 106951 steps, saw 106933 distinct states, run finished after 139283 ms. (steps per millisecond=0 ) properties seen :0
[2024-05-29 05:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 13537ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 598 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-PT-005000

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 25000
TRANSITIONS: 25000
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.745s, Sys 0.077s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.139s, Sys 0.016s]


----------------------------------------------------------------------
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: 1099
MODEL NAME: /home/mcc/execution/model
25000 places, 25000 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716961990430

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Philosophers-PT-005000"
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 Philosophers-PT-005000, 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 r267-smll-171654406700555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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