fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620503800083
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANConstruction-PT-100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15668.932 1422106.00 2471505.00 2474.50 TTTTFTFFTFFF?FTF 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.r069-tall-171620503800083.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 CANConstruction-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716382580113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:56:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 12:56:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:56:22] [INFO ] Load time of PNML (sax parser for PT used): 751 ms
[2024-05-22 12:56:22] [INFO ] Transformed 21202 places.
[2024-05-22 12:56:22] [INFO ] Transformed 40800 transitions.
[2024-05-22 12:56:22] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 979 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 391 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-22 12:56:23] [INFO ] Computed 201 invariants in 658 ms
[2024-05-22 12:56:45] [INFO ] Implicit Places using invariants in 22617 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838, 852, 866, 880, 894, 908, 922, 936, 950, 964, 978, 992, 1006, 1020, 1034, 1048, 1062, 1076, 1090, 1104, 1118, 1132, 1146, 1160, 1174, 1188, 1202, 1216, 1230, 1244, 1258, 1272, 1286, 1300, 1314, 1328, 1342, 1356, 1370, 1384, 1398]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 22722 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21102/21202 places, 40800/40800 transitions.
Discarding 9782 places :
Symmetric choice reduction at 0 with 9782 rule applications. Total rules 9782 place count 11320 transition count 21236
Iterating global reduction 0 with 9782 rules applied. Total rules applied 19564 place count 11320 transition count 21236
Applied a total of 19564 rules in 998 ms. Remains 11320 /21102 variables (removed 9782) and now considering 21236/40800 (removed 19564) transitions.
// Phase 1: matrix 21236 rows 11320 cols
[2024-05-22 12:56:47] [INFO ] Computed 101 invariants in 548 ms
[2024-05-22 12:56:58] [INFO ] Implicit Places using invariants in 11766 ms returned []
Implicit Place search using SMT only with invariants took 11769 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11320/21202 places, 21236/40800 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35906 ms. Remains : 11320/21202 places, 21236/40800 transitions.
Support contains 34 out of 11320 places after structural reductions.
[2024-05-22 12:56:59] [INFO ] Flatten gal took : 744 ms
[2024-05-22 12:57:00] [INFO ] Flatten gal took : 587 ms
[2024-05-22 12:57:01] [INFO ] Input system was already deterministic with 21236 transitions.
RANDOM walk for 40000 steps (20 resets) in 4033 ms. (9 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
[2024-05-22 12:57:03] [INFO ] Invariant cache hit.
[2024-05-22 12:57:03] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 11218/11242 variables, 24/24 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11242 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/11319 variables, 77/101 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11319 variables, 0/101 constraints. Problems are: Problem set: 9 solved, 7 unsolved
SMT process timed out in 5400ms, After SMT, problems are : Problem set: 9 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 11320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1941 place count 10343 transition count 20246
Iterating global reduction 2 with 13 rules applied. Total rules applied 1954 place count 10343 transition count 20246
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 26 rules applied. Total rules applied 1980 place count 10343 transition count 20220
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 2006 place count 10317 transition count 20220
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2026 place count 10307 transition count 20210
Applied a total of 2026 rules in 11402 ms. Remains 10307 /11320 variables (removed 1013) and now considering 20210/21236 (removed 1026) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11403 ms. Remains : 10307/11320 places, 20210/21236 transitions.
RANDOM walk for 40000 steps (56 resets) in 1703 ms. (23 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
// Phase 1: matrix 20210 rows 10307 cols
[2024-05-22 12:57:21] [INFO ] Computed 101 invariants in 711 ms
[2024-05-22 12:57:21] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10206/10211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10211 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/10306 variables, 95/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10306 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20210/30516 variables, 10306/10407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30516 variables, 19900/30307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30516 variables, 0/30307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/30517 variables, 1/30308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30517 variables, 0/30308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/30517 variables, 0/30308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30517/30517 variables, and 30308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20168 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 10307/10307 constraints, ReadFeed: 19900/19900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10206/10211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 12:58:12] [INFO ] Deduced a trap composed of 2 places in 29124 ms of which 466 ms to minimize.
[2024-05-22 12:58:42] [INFO ] Deduced a trap composed of 2 places in 30044 ms of which 77 ms to minimize.
SMT process timed out in 81807ms, 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 5 out of 10307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10307/10307 places, 20210/20210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 10305 transition count 20206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 10305 transition count 20206
Applied a total of 4 rules in 6854 ms. Remains 10305 /10307 variables (removed 2) and now considering 20206/20210 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6857 ms. Remains : 10305/10307 places, 20206/20210 transitions.
FORMULA CANConstruction-PT-100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 401 stabilizing places and 500 stable transitions
FORMULA CANConstruction-PT-100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&X(F(p1))))))'
Support contains 2 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 11304 transition count 21204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 11304 transition count 21204
Applied a total of 32 rules in 206 ms. Remains 11304 /11320 variables (removed 16) and now considering 21204/21236 (removed 32) transitions.
// Phase 1: matrix 21204 rows 11304 cols
[2024-05-22 12:58:50] [INFO ] Computed 101 invariants in 368 ms
[2024-05-22 12:59:01] [INFO ] Implicit Places using invariants in 11985 ms returned []
Implicit Place search using SMT only with invariants took 11986 ms to find 0 implicit places.
Running 21104 sub problems to find dead transitions.
[2024-05-22 12:59:01] [INFO ] Invariant cache hit.
[2024-05-22 12:59:02] [INFO ] State equation strengthened by 19900 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30377 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21104/21104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30398 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21104 constraints, Known Traps: 0/0 constraints]
After SMT, in 117952ms problems are : Problem set: 0 solved, 21104 unsolved
Search for dead transitions found 0 dead transitions in 118221ms
Starting structural reductions in LTL mode, iteration 1 : 11304/11320 places, 21204/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130489 ms. Remains : 11304/11320 places, 21204/21236 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 3124 ms.
Product exploration explored 100000 steps with 33333 reset in 2673 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLCardinality-03 finished in 136883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 11303 transition count 21202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 11303 transition count 21202
Applied a total of 34 rules in 181 ms. Remains 11303 /11320 variables (removed 17) and now considering 21202/21236 (removed 34) transitions.
// Phase 1: matrix 21202 rows 11303 cols
[2024-05-22 13:01:06] [INFO ] Computed 101 invariants in 351 ms
[2024-05-22 13:01:18] [INFO ] Implicit Places using invariants in 11603 ms returned []
Implicit Place search using SMT only with invariants took 11605 ms to find 0 implicit places.
Running 21102 sub problems to find dead transitions.
[2024-05-22 13:01:18] [INFO ] Invariant cache hit.
[2024-05-22 13:01:18] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30316 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21102/21102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30341 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21102 constraints, Known Traps: 0/0 constraints]
After SMT, in 120809ms problems are : Problem set: 0 solved, 21102 unsolved
Search for dead transitions found 0 dead transitions in 120990ms
Starting structural reductions in LTL mode, iteration 1 : 11303/11320 places, 21202/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132821 ms. Remains : 11303/11320 places, 21202/21236 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-09
Stuttering criterion allowed to conclude after 1849 steps with 0 reset in 49 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-09 finished in 133118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1945 place count 10339 transition count 20238
Iterating global reduction 2 with 17 rules applied. Total rules applied 1962 place count 10339 transition count 20238
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 1996 place count 10339 transition count 20204
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 2030 place count 10305 transition count 20204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2034 place count 10303 transition count 20202
Applied a total of 2034 rules in 11073 ms. Remains 10303 /11320 variables (removed 1017) and now considering 20202/21236 (removed 1034) transitions.
// Phase 1: matrix 20202 rows 10303 cols
[2024-05-22 13:03:31] [INFO ] Computed 101 invariants in 670 ms
[2024-05-22 13:03:41] [INFO ] Implicit Places using invariants in 10642 ms returned []
Implicit Place search using SMT only with invariants took 10645 ms to find 0 implicit places.
Running 20102 sub problems to find dead transitions.
[2024-05-22 13:03:41] [INFO ] Invariant cache hit.
[2024-05-22 13:03:41] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30256 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20102/20102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30252 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20102 constraints, Known Traps: 0/0 constraints]
After SMT, in 112853ms problems are : Problem set: 0 solved, 20102 unsolved
Search for dead transitions found 0 dead transitions in 113057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10303/11320 places, 20202/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134810 ms. Remains : 10303/11320 places, 20202/21236 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-12
Product exploration explored 100000 steps with 144 reset in 3169 ms.
Product exploration explored 100000 steps with 143 reset in 2745 ms.
Computed a total of 101 stabilizing places and 200 stable transitions
Computed a total of 101 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 27747 steps (38 resets) in 906 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 10303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10303/10303 places, 20202/20202 transitions.
Applied a total of 0 rules in 3487 ms. Remains 10303 /10303 variables (removed 0) and now considering 20202/20202 (removed 0) transitions.
[2024-05-22 13:05:44] [INFO ] Invariant cache hit.
[2024-05-22 13:05:55] [INFO ] Implicit Places using invariants in 10974 ms returned []
Implicit Place search using SMT only with invariants took 10977 ms to find 0 implicit places.
Running 20102 sub problems to find dead transitions.
[2024-05-22 13:05:55] [INFO ] Invariant cache hit.
[2024-05-22 13:05:56] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30288 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20102/20102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30261 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20102 constraints, Known Traps: 0/0 constraints]
After SMT, in 114578ms problems are : Problem set: 0 solved, 20102 unsolved
Search for dead transitions found 0 dead transitions in 114780ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129306 ms. Remains : 10303/10303 places, 20202/20202 transitions.
Computed a total of 101 stabilizing places and 200 stable transitions
Computed a total of 101 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35948 steps (50 resets) in 1777 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 144 reset in 2576 ms.
Product exploration explored 100000 steps with 145 reset in 2636 ms.
Support contains 1 out of 10303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10303/10303 places, 20202/20202 transitions.
Applied a total of 0 rules in 3336 ms. Remains 10303 /10303 variables (removed 0) and now considering 20202/20202 (removed 0) transitions.
[2024-05-22 13:08:00] [INFO ] Invariant cache hit.
[2024-05-22 13:08:10] [INFO ] Implicit Places using invariants in 10314 ms returned []
Implicit Place search using SMT only with invariants took 10314 ms to find 0 implicit places.
Running 20102 sub problems to find dead transitions.
[2024-05-22 13:08:10] [INFO ] Invariant cache hit.
[2024-05-22 13:08:10] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30273 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20102/20102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30270 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20102 constraints, Known Traps: 0/0 constraints]
After SMT, in 110882ms problems are : Problem set: 0 solved, 20102 unsolved
Search for dead transitions found 0 dead transitions in 111077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 124757 ms. Remains : 10303/10303 places, 20202/20202 transitions.
Treatment of property CANConstruction-PT-100-LTLCardinality-12 finished in 403273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 11304 transition count 21204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 11304 transition count 21204
Applied a total of 32 rules in 181 ms. Remains 11304 /11320 variables (removed 16) and now considering 21204/21236 (removed 32) transitions.
// Phase 1: matrix 21204 rows 11304 cols
[2024-05-22 13:10:03] [INFO ] Computed 101 invariants in 373 ms
[2024-05-22 13:10:14] [INFO ] Implicit Places using invariants in 11456 ms returned []
Implicit Place search using SMT only with invariants took 11457 ms to find 0 implicit places.
Running 21104 sub problems to find dead transitions.
[2024-05-22 13:10:14] [INFO ] Invariant cache hit.
[2024-05-22 13:10:14] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30276 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21104/21104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30362 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21104 constraints, Known Traps: 0/0 constraints]
After SMT, in 115177ms problems are : Problem set: 0 solved, 21104 unsolved
Search for dead transitions found 0 dead transitions in 115372ms
Starting structural reductions in LTL mode, iteration 1 : 11304/11320 places, 21204/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127098 ms. Remains : 11304/11320 places, 21204/21236 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-13 finished in 127257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(!p0))))))'
Support contains 1 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 11302 transition count 21200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 11302 transition count 21200
Applied a total of 36 rules in 172 ms. Remains 11302 /11320 variables (removed 18) and now considering 21200/21236 (removed 36) transitions.
// Phase 1: matrix 21200 rows 11302 cols
[2024-05-22 13:12:10] [INFO ] Computed 101 invariants in 421 ms
[2024-05-22 13:12:21] [INFO ] Implicit Places using invariants in 11689 ms returned []
Implicit Place search using SMT only with invariants took 11690 ms to find 0 implicit places.
Running 21100 sub problems to find dead transitions.
[2024-05-22 13:12:22] [INFO ] Invariant cache hit.
[2024-05-22 13:12:22] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11301 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11301/32502 variables, and 101 constraints, problems are : Problem set: 0 solved, 21100 unsolved in 30280 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11302 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21100/21100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11301 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11301/32502 variables, and 101 constraints, problems are : Problem set: 0 solved, 21100 unsolved in 30250 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11302 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21100 constraints, Known Traps: 0/0 constraints]
After SMT, in 112891ms problems are : Problem set: 0 solved, 21100 unsolved
Search for dead transitions found 0 dead transitions in 113077ms
Starting structural reductions in LTL mode, iteration 1 : 11302/11320 places, 21200/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124965 ms. Remains : 11302/11320 places, 21200/21236 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, p0, p0, true, true, true]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-15 finished in 125246 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)))'
[2024-05-22 13:14:15] [INFO ] Flatten gal took : 531 ms
[2024-05-22 13:14:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 13:14:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11320 places, 21236 transitions and 82572 arcs took 93 ms.
Total runtime 1074834 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-100

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.077s, 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: 866
MODEL NAME: /home/mcc/execution/414/model
11320 places, 21236 transitions.

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

BK_STOP 1716384002219

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

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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 32768 at unique_table.cc, line 313
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="CANConstruction-PT-100"
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 CANConstruction-PT-100, 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 r069-tall-171620503800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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