About the Execution of ITS-Tools for StigmergyCommit-PT-07b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 1178344.00 | 0.00 | 0.00 | ?F?????T?TF??F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800177.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-07b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800177
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12M 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 StigmergyCommit-PT-07b-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-07b-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716990040147
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 13:40:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:40:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:40:42] [INFO ] Load time of PNML (sax parser for PT used): 687 ms
[2024-05-29 13:40:42] [INFO ] Transformed 2443 places.
[2024-05-29 13:40:42] [INFO ] Transformed 15956 transitions.
[2024-05-29 13:40:42] [INFO ] Found NUPN structural information;
[2024-05-29 13:40:42] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 880 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-07b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Discarding 185 places :
Symmetric choice reduction at 0 with 185 rule applications. Total rules 185 place count 2258 transition count 15771
Iterating global reduction 0 with 185 rules applied. Total rules applied 370 place count 2258 transition count 15771
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 482 place count 2146 transition count 15659
Iterating global reduction 0 with 112 rules applied. Total rules applied 594 place count 2146 transition count 15659
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 660 place count 2080 transition count 15593
Iterating global reduction 0 with 66 rules applied. Total rules applied 726 place count 2080 transition count 15593
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 783 place count 2023 transition count 15536
Iterating global reduction 0 with 57 rules applied. Total rules applied 840 place count 2023 transition count 15536
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 888 place count 1975 transition count 15488
Iterating global reduction 0 with 48 rules applied. Total rules applied 936 place count 1975 transition count 15488
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 982 place count 1929 transition count 15442
Iterating global reduction 0 with 46 rules applied. Total rules applied 1028 place count 1929 transition count 15442
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 1073 place count 1884 transition count 15397
Iterating global reduction 0 with 45 rules applied. Total rules applied 1118 place count 1884 transition count 15397
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1162 place count 1840 transition count 15353
Iterating global reduction 0 with 44 rules applied. Total rules applied 1206 place count 1840 transition count 15353
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 1242 place count 1804 transition count 15317
Iterating global reduction 0 with 36 rules applied. Total rules applied 1278 place count 1804 transition count 15317
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1306 place count 1776 transition count 15289
Iterating global reduction 0 with 28 rules applied. Total rules applied 1334 place count 1776 transition count 15289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1339 place count 1776 transition count 15284
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1347 place count 1768 transition count 15276
Iterating global reduction 1 with 8 rules applied. Total rules applied 1355 place count 1768 transition count 15276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1363 place count 1760 transition count 15268
Iterating global reduction 1 with 8 rules applied. Total rules applied 1371 place count 1760 transition count 15268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1374 place count 1757 transition count 15265
Iterating global reduction 1 with 3 rules applied. Total rules applied 1377 place count 1757 transition count 15265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1380 place count 1754 transition count 15262
Iterating global reduction 1 with 3 rules applied. Total rules applied 1383 place count 1754 transition count 15262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1386 place count 1751 transition count 15259
Iterating global reduction 1 with 3 rules applied. Total rules applied 1389 place count 1751 transition count 15259
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1391 place count 1749 transition count 15257
Iterating global reduction 1 with 2 rules applied. Total rules applied 1393 place count 1749 transition count 15257
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1395 place count 1747 transition count 15255
Iterating global reduction 1 with 2 rules applied. Total rules applied 1397 place count 1747 transition count 15255
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1399 place count 1745 transition count 15253
Iterating global reduction 1 with 2 rules applied. Total rules applied 1401 place count 1745 transition count 15253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1403 place count 1743 transition count 15251
Iterating global reduction 1 with 2 rules applied. Total rules applied 1405 place count 1743 transition count 15251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1407 place count 1741 transition count 15249
Iterating global reduction 1 with 2 rules applied. Total rules applied 1409 place count 1741 transition count 15249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1411 place count 1739 transition count 15247
Iterating global reduction 1 with 2 rules applied. Total rules applied 1413 place count 1739 transition count 15247
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1415 place count 1737 transition count 15245
Iterating global reduction 1 with 2 rules applied. Total rules applied 1417 place count 1737 transition count 15245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1419 place count 1737 transition count 15243
Applied a total of 1419 rules in 4700 ms. Remains 1737 /2443 variables (removed 706) and now considering 15243/15956 (removed 713) transitions.
// Phase 1: matrix 15243 rows 1737 cols
[2024-05-29 13:40:47] [INFO ] Computed 9 invariants in 448 ms
[2024-05-29 13:40:51] [INFO ] Implicit Places using invariants in 4816 ms returned []
Implicit Place search using SMT only with invariants took 4852 ms to find 0 implicit places.
Running 15242 sub problems to find dead transitions.
[2024-05-29 13:40:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1736/16980 variables, and 0 constraints, problems are : Problem set: 0 solved, 15242 unsolved in 30252 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1737 constraints, PredecessorRefiner: 15242/2069 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1736/16980 variables, and 0 constraints, problems are : Problem set: 0 solved, 15242 unsolved in 30162 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1737 constraints, PredecessorRefiner: 13173/2069 constraints, Known Traps: 0/0 constraints]
After SMT, in 255700ms problems are : Problem set: 0 solved, 15242 unsolved
Search for dead transitions found 0 dead transitions in 255890ms
Starting structural reductions in LTL mode, iteration 1 : 1737/2443 places, 15243/15956 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265550 ms. Remains : 1737/2443 places, 15243/15956 transitions.
Support contains 64 out of 1737 places after structural reductions.
[2024-05-29 13:45:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 13:45:09] [INFO ] Flatten gal took : 1476 ms
[2024-05-29 13:45:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA StigmergyCommit-PT-07b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 13:45:10] [INFO ] Flatten gal took : 1105 ms
[2024-05-29 13:45:13] [INFO ] Input system was already deterministic with 15243 transitions.
Support contains 48 out of 1737 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (270 resets) in 2455 ms. (16 steps per ms) remains 20/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
[2024-05-29 13:45:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1688/1721 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1721 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 16/1737 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1737 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16980/16980 variables, and 1746 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1737/1737 constraints, PredecessorRefiner: 20/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 1688/1721 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-29 13:45:27] [INFO ] Deduced a trap composed of 313 places in 7386 ms of which 89 ms to minimize.
SMT process timed out in 12876ms, After SMT, problems are : Problem set: 1 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1737/1737 places, 15243/15243 transitions.
Graph (trivial) has 1673 edges and 1737 vertex of which 122 / 1737 are part of one of the 22 SCC in 9 ms
Free SCC test removed 100 places
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 3277 edges and 1637 vertex of which 1629 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.67 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1181 transitions
Trivial Post-agglo rules discarded 1181 transitions
Performed 1181 trivial Post agglomeration. Transition count delta: 1181
Iterating post reduction 0 with 1189 rules applied. Total rules applied 1191 place count 1629 transition count 13918
Reduce places removed 1181 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1204 rules applied. Total rules applied 2395 place count 448 transition count 13895
Reduce places removed 9 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 22 rules applied. Total rules applied 2417 place count 439 transition count 13882
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 2434 place count 426 transition count 13878
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2436 place count 424 transition count 13878
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 92 Pre rules applied. Total rules applied 2436 place count 424 transition count 13786
Deduced a syphon composed of 92 places in 6 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 5 with 184 rules applied. Total rules applied 2620 place count 332 transition count 13786
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2628 place count 324 transition count 13778
Iterating global reduction 5 with 8 rules applied. Total rules applied 2636 place count 324 transition count 13778
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2637 place count 324 transition count 13777
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2637 place count 324 transition count 13775
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2641 place count 322 transition count 13775
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2645 place count 318 transition count 11570
Iterating global reduction 6 with 4 rules applied. Total rules applied 2649 place count 318 transition count 11570
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2651 place count 318 transition count 11568
Performed 77 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 2805 place count 241 transition count 11483
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2809 place count 241 transition count 11479
Discarding 37 places :
Symmetric choice reduction at 8 with 37 rule applications. Total rules 2846 place count 204 transition count 1352
Iterating global reduction 8 with 37 rules applied. Total rules applied 2883 place count 204 transition count 1352
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2901 place count 204 transition count 1334
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 2915 place count 190 transition count 1320
Iterating global reduction 9 with 14 rules applied. Total rules applied 2929 place count 190 transition count 1320
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 2942 place count 177 transition count 1307
Iterating global reduction 9 with 13 rules applied. Total rules applied 2955 place count 177 transition count 1307
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2962 place count 177 transition count 1300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2966 place count 175 transition count 1310
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2970 place count 175 transition count 1306
Free-agglomeration rule applied 53 times.
Iterating global reduction 10 with 53 rules applied. Total rules applied 3023 place count 175 transition count 1253
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 54 rules applied. Total rules applied 3077 place count 122 transition count 1252
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3083 place count 116 transition count 1246
Iterating global reduction 11 with 6 rules applied. Total rules applied 3089 place count 116 transition count 1246
Drop transitions (Redundant composition of simpler transitions.) removed 262 transitions
Redundant transition composition rules discarded 262 transitions
Iterating global reduction 11 with 262 rules applied. Total rules applied 3351 place count 116 transition count 984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3353 place count 115 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3355 place count 114 transition count 986
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3357 place count 114 transition count 984
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3359 place count 112 transition count 984
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3367 place count 112 transition count 984
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 3372 place count 112 transition count 979
Applied a total of 3372 rules in 3519 ms. Remains 112 /1737 variables (removed 1625) and now considering 979/15243 (removed 14264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3519 ms. Remains : 112/1737 places, 979/15243 transitions.
RANDOM walk for 40000 steps (1414 resets) in 2124 ms. (18 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (190 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (173 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (184 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (183 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (175 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (182 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (181 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (195 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (189 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
// Phase 1: matrix 979 rows 112 cols
[2024-05-29 13:45:32] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 13:45:32] [INFO ] State equation strengthened by 887 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 83/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 979/1091 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 887/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1091 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/1091 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 1008 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 887/887 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 83/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 13:45:33] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2024-05-29 13:45:33] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 0 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 2 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-05-29 13:45:34] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:45:35] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
[2024-05-29 13:45:35] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2024-05-29 13:45:35] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2024-05-29 13:45:35] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:45:35] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:45:36] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:45:36] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:45:36] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:45:36] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 17/24 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/112 variables, 2/26 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 979/1091 variables, 112/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1091 variables, 887/1025 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1091 variables, 9/1034 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 13:45:37] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2024-05-29 13:45:37] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2024-05-29 13:45:37] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2024-05-29 13:45:38] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2024-05-29 13:45:38] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1091 variables, 5/1039 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1091 variables, 0/1039 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1091 variables, 0/1039 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1039 constraints, problems are : Problem set: 1 solved, 9 unsolved in 6860 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 887/887 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 22/22 constraints]
After SMT, in 8163ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 93 steps, including 2 resets, run visited all 9 properties in 10 ms. (steps per millisecond=9 )
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 9 properties in 27 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-05-29 13:45:41] [INFO ] Flatten gal took : 1142 ms
[2024-05-29 13:45:42] [INFO ] Flatten gal took : 1148 ms
[2024-05-29 13:45:45] [INFO ] Input system was already deterministic with 15243 transitions.
Computed a total of 341 stabilizing places and 357 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1737/1737 places, 15243/15243 transitions.
Graph (trivial) has 1725 edges and 1737 vertex of which 136 / 1737 are part of one of the 24 SCC in 3 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1205 transitions
Trivial Post-agglo rules discarded 1205 transitions
Performed 1205 trivial Post agglomeration. Transition count delta: 1205
Iterating post reduction 0 with 1205 rules applied. Total rules applied 1206 place count 1624 transition count 13909
Reduce places removed 1205 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1229 rules applied. Total rules applied 2435 place count 419 transition count 13885
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 2445 place count 410 transition count 13884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2446 place count 409 transition count 13884
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 2446 place count 409 transition count 13798
Deduced a syphon composed of 86 places in 6 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2618 place count 323 transition count 13798
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2641 place count 300 transition count 13775
Iterating global reduction 4 with 23 rules applied. Total rules applied 2664 place count 300 transition count 13775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2665 place count 300 transition count 13774
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2665 place count 300 transition count 13770
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2673 place count 296 transition count 13770
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2681 place count 288 transition count 9375
Iterating global reduction 5 with 8 rules applied. Total rules applied 2689 place count 288 transition count 9375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2693 place count 288 transition count 9371
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2695 place count 286 transition count 9369
Iterating global reduction 6 with 2 rules applied. Total rules applied 2697 place count 286 transition count 9369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2698 place count 286 transition count 9368
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2699 place count 285 transition count 9367
Iterating global reduction 7 with 1 rules applied. Total rules applied 2700 place count 285 transition count 9367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2701 place count 285 transition count 9366
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 2811 place count 230 transition count 9311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2815 place count 230 transition count 9307
Discarding 47 places :
Symmetric choice reduction at 9 with 47 rule applications. Total rules 2862 place count 183 transition count 1157
Iterating global reduction 9 with 47 rules applied. Total rules applied 2909 place count 183 transition count 1157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2929 place count 183 transition count 1137
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2956 place count 156 transition count 1102
Iterating global reduction 10 with 27 rules applied. Total rules applied 2983 place count 156 transition count 1102
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 3010 place count 129 transition count 1075
Iterating global reduction 10 with 27 rules applied. Total rules applied 3037 place count 129 transition count 1075
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 3048 place count 129 transition count 1064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3050 place count 128 transition count 1063
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 3058 place count 128 transition count 1055
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 3074 place count 120 transition count 1047
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3075 place count 119 transition count 1046
Applied a total of 3075 rules in 1774 ms. Remains 119 /1737 variables (removed 1618) and now considering 1046/15243 (removed 14197) transitions.
[2024-05-29 13:45:47] [INFO ] Flow matrix only has 1037 transitions (discarded 9 similar events)
// Phase 1: matrix 1037 rows 119 cols
[2024-05-29 13:45:47] [INFO ] Computed 2 invariants in 18 ms
[2024-05-29 13:45:48] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-29 13:45:48] [INFO ] Flow matrix only has 1037 transitions (discarded 9 similar events)
[2024-05-29 13:45:48] [INFO ] Invariant cache hit.
[2024-05-29 13:45:48] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 13:45:49] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-29 13:45:49] [INFO ] Redundant transitions in 57 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-05-29 13:45:49] [INFO ] Flow matrix only has 1037 transitions (discarded 9 similar events)
[2024-05-29 13:45:49] [INFO ] Invariant cache hit.
[2024-05-29 13:45:49] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (OVERLAPS) 8/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-29 13:46:06] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 1 ms to minimize.
[2024-05-29 13:46:07] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 1 ms to minimize.
[2024-05-29 13:46:07] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2024-05-29 13:46:07] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 0 ms to minimize.
[2024-05-29 13:46:08] [INFO ] Deduced a trap composed of 24 places in 570 ms of which 0 ms to minimize.
[2024-05-29 13:46:08] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2024-05-29 13:46:09] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2024-05-29 13:46:09] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 1 ms to minimize.
[2024-05-29 13:46:09] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 1 ms to minimize.
[2024-05-29 13:46:09] [INFO ] Deduced a trap composed of 21 places in 323 ms of which 1 ms to minimize.
[2024-05-29 13:46:10] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 1 ms to minimize.
[2024-05-29 13:46:10] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 0 ms to minimize.
[2024-05-29 13:46:10] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:46:11] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 1 ms to minimize.
[2024-05-29 13:46:11] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 0 ms to minimize.
[2024-05-29 13:46:11] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 0 ms to minimize.
[2024-05-29 13:46:12] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 1 ms to minimize.
[2024-05-29 13:46:12] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
[2024-05-29 13:46:12] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 0 ms to minimize.
[2024-05-29 13:46:12] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-29 13:46:15] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 1 ms to minimize.
[2024-05-29 13:46:16] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 0 ms to minimize.
[2024-05-29 13:46:16] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 0 ms to minimize.
[2024-05-29 13:46:16] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2024-05-29 13:46:17] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2024-05-29 13:46:17] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 1 ms to minimize.
[2024-05-29 13:46:17] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 0 ms to minimize.
[2024-05-29 13:46:19] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 1 ms to minimize.
[2024-05-29 13:46:19] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 0 ms to minimize.
[2024-05-29 13:46:19] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 0 ms to minimize.
[2024-05-29 13:46:21] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 1 ms to minimize.
[2024-05-29 13:46:21] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 1 ms to minimize.
[2024-05-29 13:46:22] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 0 ms to minimize.
[2024-05-29 13:46:22] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 13 ms to minimize.
[2024-05-29 13:46:22] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 1 ms to minimize.
[2024-05-29 13:46:23] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 0 ms to minimize.
[2024-05-29 13:46:23] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 1 ms to minimize.
[2024-05-29 13:46:25] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 0 ms to minimize.
[2024-05-29 13:46:26] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
[2024-05-29 13:46:26] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-29 13:46:27] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 0 ms to minimize.
[2024-05-29 13:46:27] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 1 ms to minimize.
[2024-05-29 13:46:27] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:46:28] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2024-05-29 13:46:28] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 1 ms to minimize.
[2024-05-29 13:46:28] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2024-05-29 13:46:29] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 0 ms to minimize.
[2024-05-29 13:46:29] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)timeout
(s8 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/1156 variables, and 50 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/119 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1029/1029 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1029 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (OVERLAPS) 8/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-29 13:46:35] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 1 ms to minimize.
[2024-05-29 13:46:40] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 0 ms to minimize.
[2024-05-29 13:46:40] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 6 (OVERLAPS) 1036/1155 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1155 variables, 254/426 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/1156 variables, and 1455 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 31852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 1029/1029 constraints, Known Traps: 51/51 constraints]
After SMT, in 72849ms problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 72861ms
Starting structural reductions in SI_CTL mode, iteration 1 : 119/1737 places, 1046/15243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76704 ms. Remains : 119/1737 places, 1046/15243 transitions.
[2024-05-29 13:47:02] [INFO ] Flatten gal took : 106 ms
[2024-05-29 13:47:02] [INFO ] Flatten gal took : 100 ms
[2024-05-29 13:47:02] [INFO ] Input system was already deterministic with 1046 transitions.
[2024-05-29 13:47:02] [INFO ] Flatten gal took : 98 ms
[2024-05-29 13:47:02] [INFO ] Flatten gal took : 96 ms
[2024-05-29 13:47:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality377023487206792943.gal : 59 ms
[2024-05-29 13:47:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality8748135597904504864.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality377023487206792943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8748135597904504864.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 13:47:33] [INFO ] Flatten gal took : 93 ms
[2024-05-29 13:47:33] [INFO ] Applying decomposition
[2024-05-29 13:47:33] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16956621657404778236.txt' '-o' '/tmp/graph16956621657404778236.bin' '-w' '/tmp/graph16956621657404778236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16956621657404778236.bin' '-l' '-1' '-v' '-w' '/tmp/graph16956621657404778236.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:47:33] [INFO ] Decomposing Gal with order
[2024-05-29 13:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:47:33] [INFO ] Removed a total of 7203 redundant transitions.
[2024-05-29 13:47:34] [INFO ] Flatten gal took : 247 ms
[2024-05-29 13:47:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 72 ms.
[2024-05-29 13:47:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11276150678827376986.gal : 13 ms
[2024-05-29 13:47:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15296714910789037382.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11276150678827376986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15296714910789037382.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1737/1737 places, 15243/15243 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1713 transition count 15219
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1713 transition count 15219
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 1695 transition count 15201
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 1695 transition count 15201
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1684 transition count 15190
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1684 transition count 15190
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 1674 transition count 15180
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 1674 transition count 15180
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 135 place count 1665 transition count 15171
Iterating global reduction 0 with 9 rules applied. Total rules applied 144 place count 1665 transition count 15171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 1665 transition count 15170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 152 place count 1658 transition count 15163
Iterating global reduction 1 with 7 rules applied. Total rules applied 159 place count 1658 transition count 15163
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 166 place count 1651 transition count 15156
Iterating global reduction 1 with 7 rules applied. Total rules applied 173 place count 1651 transition count 15156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 174 place count 1651 transition count 15155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 180 place count 1645 transition count 15149
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 1645 transition count 15149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 190 place count 1641 transition count 15145
Iterating global reduction 2 with 4 rules applied. Total rules applied 194 place count 1641 transition count 15145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 1641 transition count 15144
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 1638 transition count 15141
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 1638 transition count 15141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 1636 transition count 15139
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 1636 transition count 15139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 1634 transition count 15137
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 1634 transition count 15137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 211 place count 1632 transition count 15135
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 1632 transition count 15135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 215 place count 1630 transition count 15133
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 1630 transition count 15133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 1630 transition count 15132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 1629 transition count 15131
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 1629 transition count 15131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 221 place count 1628 transition count 15130
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 1628 transition count 15130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 1627 transition count 15129
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 1627 transition count 15129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 1626 transition count 15128
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 1626 transition count 15128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 227 place count 1625 transition count 15127
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 1625 transition count 15127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 229 place count 1624 transition count 15126
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 1624 transition count 15126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 231 place count 1623 transition count 15125
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 1623 transition count 15125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 1622 transition count 15124
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 1622 transition count 15124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 1622 transition count 15123
Applied a total of 235 rules in 3706 ms. Remains 1622 /1737 variables (removed 115) and now considering 15123/15243 (removed 120) transitions.
// Phase 1: matrix 15123 rows 1622 cols
[2024-05-29 13:48:08] [INFO ] Computed 9 invariants in 300 ms
[2024-05-29 13:48:12] [INFO ] Implicit Places using invariants in 4712 ms returned []
Implicit Place search using SMT only with invariants took 4723 ms to find 0 implicit places.
Running 15122 sub problems to find dead transitions.
[2024-05-29 13:48:12] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1621/16745 variables, and 0 constraints, problems are : Problem set: 0 solved, 15122 unsolved in 30162 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1622 constraints, PredecessorRefiner: 15122/1952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1621/16745 variables, and 0 constraints, problems are : Problem set: 0 solved, 15122 unsolved in 30148 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1622 constraints, PredecessorRefiner: 13170/1952 constraints, Known Traps: 0/0 constraints]
After SMT, in 279755ms problems are : Problem set: 0 solved, 15122 unsolved
Search for dead transitions found 0 dead transitions in 279919ms
Starting structural reductions in LTL mode, iteration 1 : 1622/1737 places, 15123/15243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288391 ms. Remains : 1622/1737 places, 15123/15243 transitions.
[2024-05-29 13:52:53] [INFO ] Flatten gal took : 1150 ms
[2024-05-29 13:52:55] [INFO ] Flatten gal took : 1067 ms
[2024-05-29 13:52:58] [INFO ] Input system was already deterministic with 15123 transitions.
[2024-05-29 13:52:59] [INFO ] Flatten gal took : 1031 ms
[2024-05-29 13:53:00] [INFO ] Flatten gal took : 1147 ms
[2024-05-29 13:53:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14440067760243307815.gal : 192 ms
[2024-05-29 13:53:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7810842133272965223.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14440067760243307815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7810842133272965223.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 13:53:32] [INFO ] Flatten gal took : 1026 ms
[2024-05-29 13:53:32] [INFO ] Applying decomposition
[2024-05-29 13:53:33] [INFO ] Flatten gal took : 1122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7202768701334426270.txt' '-o' '/tmp/graph7202768701334426270.bin' '-w' '/tmp/graph7202768701334426270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7202768701334426270.bin' '-l' '-1' '-v' '-w' '/tmp/graph7202768701334426270.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:53:37] [INFO ] Decomposing Gal with order
[2024-05-29 13:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:53:40] [INFO ] Removed a total of 107292 redundant transitions.
[2024-05-29 13:53:40] [INFO ] Flatten gal took : 1852 ms
[2024-05-29 13:53:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 651 ms.
[2024-05-29 13:53:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11101877655561794394.gal : 125 ms
[2024-05-29 13:53:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11515875685722596102.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11101877655561794394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11515875685722596102.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1737/1737 places, 15243/15243 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1711 transition count 15217
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1711 transition count 15217
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 1690 transition count 15196
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 1690 transition count 15196
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 108 place count 1676 transition count 15182
Iterating global reduction 0 with 14 rules applied. Total rules applied 122 place count 1676 transition count 15182
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 136 place count 1662 transition count 15168
Iterating global reduction 0 with 14 rules applied. Total rules applied 150 place count 1662 transition count 15168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 151 place count 1662 transition count 15167
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 163 place count 1650 transition count 15155
Iterating global reduction 1 with 12 rules applied. Total rules applied 175 place count 1650 transition count 15155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 176 place count 1650 transition count 15154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 1640 transition count 15144
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 1640 transition count 15144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 206 place count 1630 transition count 15134
Iterating global reduction 2 with 10 rules applied. Total rules applied 216 place count 1630 transition count 15134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 1630 transition count 15133
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 1621 transition count 15124
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 1621 transition count 15124
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 1614 transition count 15117
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 1614 transition count 15117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 1614 transition count 15116
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 256 place count 1608 transition count 15110
Iterating global reduction 4 with 6 rules applied. Total rules applied 262 place count 1608 transition count 15110
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 267 place count 1603 transition count 15105
Iterating global reduction 4 with 5 rules applied. Total rules applied 272 place count 1603 transition count 15105
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 277 place count 1598 transition count 15100
Iterating global reduction 4 with 5 rules applied. Total rules applied 282 place count 1598 transition count 15100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 1598 transition count 15099
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 287 place count 1594 transition count 15095
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 1594 transition count 15095
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 295 place count 1590 transition count 15091
Iterating global reduction 5 with 4 rules applied. Total rules applied 299 place count 1590 transition count 15091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 300 place count 1590 transition count 15090
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 303 place count 1587 transition count 15087
Iterating global reduction 6 with 3 rules applied. Total rules applied 306 place count 1587 transition count 15087
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 309 place count 1584 transition count 15084
Iterating global reduction 6 with 3 rules applied. Total rules applied 312 place count 1584 transition count 15084
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 315 place count 1581 transition count 15081
Iterating global reduction 6 with 3 rules applied. Total rules applied 318 place count 1581 transition count 15081
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 321 place count 1578 transition count 15078
Iterating global reduction 6 with 3 rules applied. Total rules applied 324 place count 1578 transition count 15078
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 327 place count 1575 transition count 15075
Iterating global reduction 6 with 3 rules applied. Total rules applied 330 place count 1575 transition count 15075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 331 place count 1575 transition count 15074
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 333 place count 1573 transition count 15072
Iterating global reduction 7 with 2 rules applied. Total rules applied 335 place count 1573 transition count 15072
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 337 place count 1571 transition count 15070
Iterating global reduction 7 with 2 rules applied. Total rules applied 339 place count 1571 transition count 15070
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 341 place count 1569 transition count 15068
Iterating global reduction 7 with 2 rules applied. Total rules applied 343 place count 1569 transition count 15068
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 345 place count 1569 transition count 15066
Applied a total of 345 rules in 3341 ms. Remains 1569 /1737 variables (removed 168) and now considering 15066/15243 (removed 177) transitions.
// Phase 1: matrix 15066 rows 1569 cols
[2024-05-29 13:54:15] [INFO ] Computed 9 invariants in 313 ms
[2024-05-29 13:54:19] [INFO ] Implicit Places using invariants in 4549 ms returned []
Implicit Place search using SMT only with invariants took 4549 ms to find 0 implicit places.
Running 15065 sub problems to find dead transitions.
[2024-05-29 13:54:19] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1568/16635 variables, and 0 constraints, problems are : Problem set: 0 solved, 15065 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 15065/1895 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15065 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1568/16635 variables, and 0 constraints, problems are : Problem set: 0 solved, 15065 unsolved in 30170 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 13170/1895 constraints, Known Traps: 0/0 constraints]
After SMT, in 287726ms problems are : Problem set: 0 solved, 15065 unsolved
Search for dead transitions found 0 dead transitions in 287868ms
Starting structural reductions in LTL mode, iteration 1 : 1569/1737 places, 15066/15243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295796 ms. Remains : 1569/1737 places, 15066/15243 transitions.
[2024-05-29 13:59:08] [INFO ] Flatten gal took : 1018 ms
[2024-05-29 13:59:09] [INFO ] Flatten gal took : 1060 ms
[2024-05-29 13:59:12] [INFO ] Input system was already deterministic with 15066 transitions.
[2024-05-29 13:59:13] [INFO ] Flatten gal took : 1117 ms
[2024-05-29 13:59:14] [INFO ] Flatten gal took : 1130 ms
[2024-05-29 13:59:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10486489158568947493.gal : 183 ms
[2024-05-29 13:59:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13039953545227607749.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10486489158568947493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13039953545227607749.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 13:59:45] [INFO ] Flatten gal took : 1040 ms
[2024-05-29 13:59:45] [INFO ] Applying decomposition
[2024-05-29 13:59:46] [INFO ] Flatten gal took : 1051 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11669350265637727353.txt' '-o' '/tmp/graph11669350265637727353.bin' '-w' '/tmp/graph11669350265637727353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11669350265637727353.bin' '-l' '-1' '-v' '-w' '/tmp/graph11669350265637727353.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:59:50] [INFO ] Decomposing Gal with order
[2024-05-29 13:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:59:53] [INFO ] Removed a total of 107271 redundant transitions.
[2024-05-29 13:59:54] [INFO ] Flatten gal took : 2009 ms
[2024-05-29 13:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 461 ms.
[2024-05-29 13:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15332484230840551074.gal : 54 ms
[2024-05-29 13:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11512965022475927171.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15332484230840551074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11512965022475927171.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
BK_STOP 1716991218491
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-07b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07b, 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 r400-tall-171690531800177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07b.tgz
mv StigmergyCommit-PT-07b 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 '
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 ;