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-171654406400441.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-COL-002000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406400441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Apr 13 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 13 11:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 13 11:14 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 3.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 13 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 96K 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-COL-002000-CTLCardinality-2024-00
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-01
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-02
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-03
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-04
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-05
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-06
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-07
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-08
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-09
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-10
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-11
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-12
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-13
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-14
FORMULA_NAME Philosophers-COL-002000-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716879915220

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-002000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:05:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:05:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:05:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 07:05:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:05:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1106 ms
[2024-05-28 07:05:18] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
[2024-05-28 07:05:18] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 6 ms.
[2024-05-28 07:05:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-002000-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40036 steps (16 resets) in 137 ms. (290 steps per ms) remains 20/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 182 ms. (21 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 07:05:19] [INFO ] Computed 2 invariants in 5 ms
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 7 constraints, problems are : Problem set: 1 solved, 14 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 14/21 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 21 constraints, problems are : Problem set: 1 solved, 14 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 1 solved, 14 unsolved
Finished Parikh walk after 73976 steps, including 38 resets, run visited all 2 properties in 55 ms. (steps per millisecond=1345 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 5817 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-28 07:05:25] [INFO ] Flatten gal took : 20 ms
[2024-05-28 07:05:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Philosophers-COL-002000-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:05:25] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2024-05-28 07:05:26] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 335 ms.
[2024-05-28 07:05:26] [INFO ] Unfolded 14 HLPN properties in 15 ms.
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 93 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2024-05-28 07:05:26] [INFO ] Computed 4000 invariants in 114 ms
[2024-05-28 07:05:30] [INFO ] Implicit Places using invariants in 4017 ms returned []
Implicit Place search using SMT only with invariants took 4030 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-05-28 07:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30263 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 67352ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 67511ms
Finished structural reductions in LTL mode , in 1 iterations and 71684 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2024-05-28 07:06:39] [INFO ] Flatten gal took : 723 ms
[2024-05-28 07:06:40] [INFO ] Flatten gal took : 469 ms
[2024-05-28 07:06:42] [INFO ] Input system was already deterministic with 10000 transitions.
RANDOM walk for 36597 steps (8 resets) in 120008 ms. (0 steps per ms) remains 12/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10635 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 24012 steps (4 resets) in 23477 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10572 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10131 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10255 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10157 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10458 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10643 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 36020 steps (8 resets) in 20995 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 24012 steps (4 resets) in 20403 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10305 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 39008 steps (8 resets) in 21625 ms. (1 steps per ms) remains 12/12 properties
[2024-05-28 07:07:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10000/20000 variables, and 4000 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5032 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10000/20000 variables, and 4000 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 15053ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 189 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 10000/10000 places, 10000/10000 transitions.
RANDOM walk for 40000 steps (8 resets) in 109697 ms. (0 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10359 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 22012 steps (4 resets) in 21651 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10203 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9950 ms. (4 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10137 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9941 ms. (4 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10135 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10217 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 36020 steps (8 resets) in 20945 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 24012 steps (4 resets) in 20293 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10210 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22020 ms. (1 steps per ms) remains 12/12 properties
Probabilistic random walk after 201737 steps, saw 201624 distinct states, run finished after 208134 ms. (steps per millisecond=0 ) properties seen :0
[2024-05-28 07:12:48] [INFO ] Invariant cache hit.
Problem AtomicPropp11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10000 variables, 4000/4000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10000 variables, 0/4000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 10000/20000 variables, 10000/14000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20000 variables, 0/14000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/20000 variables, and 14000 constraints, problems are : Problem set: 1 solved, 11 unsolved in 45121 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 10000/10000 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 2000/10000 variables, 4000/4000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10000 variables, 0/4000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10000/20000 variables, 10000/14000 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/20000 variables, and 14000 constraints, problems are : Problem set: 1 solved, 11 unsolved in 45122 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 10000/10000 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 96587ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 525 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-28 07:14:26] [INFO ] Flatten gal took : 315 ms
[2024-05-28 07:14:27] [INFO ] Flatten gal took : 335 ms
[2024-05-28 07:14:28] [INFO ] Input system was already deterministic with 10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 39 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:29] [INFO ] Flatten gal took : 355 ms
[2024-05-28 07:14:29] [INFO ] Flatten gal took : 314 ms
[2024-05-28 07:14:30] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1659 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1669 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:32] [INFO ] Flatten gal took : 394 ms
[2024-05-28 07:14:33] [INFO ] Flatten gal took : 446 ms
[2024-05-28 07:14:33] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 997 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 998 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:35] [INFO ] Flatten gal took : 255 ms
[2024-05-28 07:14:35] [INFO ] Flatten gal took : 278 ms
[2024-05-28 07:14:35] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 313 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:36] [INFO ] Flatten gal took : 259 ms
[2024-05-28 07:14:36] [INFO ] Flatten gal took : 285 ms
[2024-05-28 07:14:37] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 939 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 940 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:38] [INFO ] Flatten gal took : 257 ms
[2024-05-28 07:14:38] [INFO ] Flatten gal took : 281 ms
[2024-05-28 07:14:39] [INFO ] Input system was already deterministic with 10000 transitions.
RANDOM walk for 2513 steps (0 resets) in 2109 ms. (1 steps per ms) remains 0/1 properties
FORMULA Philosophers-COL-002000-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 741 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:41] [INFO ] Flatten gal took : 279 ms
[2024-05-28 07:14:41] [INFO ] Flatten gal took : 291 ms
[2024-05-28 07:14:41] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 20 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:42] [INFO ] Flatten gal took : 246 ms
[2024-05-28 07:14:42] [INFO ] Flatten gal took : 280 ms
[2024-05-28 07:14:43] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 463 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:43] [INFO ] Flatten gal took : 255 ms
[2024-05-28 07:14:44] [INFO ] Flatten gal took : 265 ms
[2024-05-28 07:14:44] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 187 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:45] [INFO ] Flatten gal took : 251 ms
[2024-05-28 07:14:45] [INFO ] Flatten gal took : 274 ms
[2024-05-28 07:14:45] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 224 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 225 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:46] [INFO ] Flatten gal took : 239 ms
[2024-05-28 07:14:46] [INFO ] Flatten gal took : 271 ms
[2024-05-28 07:14:47] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 161 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:47] [INFO ] Flatten gal took : 239 ms
[2024-05-28 07:14:48] [INFO ] Flatten gal took : 274 ms
[2024-05-28 07:14:48] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 113 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:49] [INFO ] Flatten gal took : 235 ms
[2024-05-28 07:14:49] [INFO ] Flatten gal took : 276 ms
[2024-05-28 07:14:49] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 109 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:50] [INFO ] Flatten gal took : 234 ms
[2024-05-28 07:14:50] [INFO ] Flatten gal took : 269 ms
[2024-05-28 07:14:51] [INFO ] Input system was already deterministic with 10000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 775 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 776 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-05-28 07:14:52] [INFO ] Flatten gal took : 233 ms
[2024-05-28 07:14:52] [INFO ] Flatten gal took : 267 ms
[2024-05-28 07:14:52] [INFO ] Input system was already deterministic with 10000 transitions.
[2024-05-28 07:14:53] [INFO ] Flatten gal took : 304 ms
[2024-05-28 07:14:54] [INFO ] Flatten gal took : 314 ms
[2024-05-28 07:14:54] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 55 ms.
[2024-05-28 07:14:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 10000 transitions and 32000 arcs took 58 ms.
Total runtime 577960 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-002000

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.090s, 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: 597
MODEL NAME: /home/mcc/execution/412/model
10000 places, 10000 transitions.

Creating all event NSFs..
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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Philosophers-COL-002000-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA Philosophers-COL-002000-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716880807148

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

ERROR: std::bad_alloc

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-COL-002000"
export BK_EXAMINATION="CTLCardinality"
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-COL-002000, examination is CTLCardinality"
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-171654406400441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;