fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446500155
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S04J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 395193.00 0.00 0.00 FF????F???????FT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446500155.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S04J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J06T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716909854154

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:24:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:24:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:24:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 737 ms
[2024-05-28 15:24:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:24:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 15:24:16] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (12 resets) in 704 ms. (56 steps per ms) remains 3/35 properties
BEST_FIRST walk for 40001 steps (12 resets) in 339 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 225 ms. (176 steps per ms) remains 3/3 properties
[2024-05-28 15:24:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:24:17] [INFO ] Computed 26 invariants in 14 ms
[2024-05-28 15:24:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/40 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/49 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/53 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 79/145 variables, and 25 constraints, problems are : Problem set: 3 solved, 0 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:24:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 15:24:17] [INFO ] Flatten gal took : 55 ms
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:24:17] [INFO ] Flatten gal took : 14 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 15:24:18] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 125 ms.
[2024-05-28 15:24:18] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 420 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 97 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-05-28 15:24:18] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-05-28 15:24:18] [INFO ] Computed 54 invariants in 168 ms
[2024-05-28 15:24:18] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 29140ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 29193ms
[2024-05-28 15:24:47] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 15:24:47] [INFO ] Invariant cache hit.
[2024-05-28 15:24:47] [INFO ] Implicit Places using invariants in 442 ms returned [612, 613, 614, 615, 616, 617, 618, 619]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 451 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 780/792 places, 2100/2100 transitions.
Applied a total of 0 rules in 30 ms. Remains 780 /780 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29812 ms. Remains : 780/792 places, 2100/2100 transitions.
Support contains 420 out of 780 places after structural reductions.
[2024-05-28 15:24:48] [INFO ] Flatten gal took : 218 ms
[2024-05-28 15:24:48] [INFO ] Flatten gal took : 165 ms
[2024-05-28 15:24:48] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 419 out of 780 places (down from 420) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 468 ms. (85 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2024-05-28 15:24:49] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 780 cols
[2024-05-28 15:24:49] [INFO ] Computed 46 invariants in 58 ms
[2024-05-28 15:24:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 577/585 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/621 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 778/2848 variables, and 45 constraints, problems are : Problem set: 1 solved, 0 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))&&G(p1)) U G(p2))))'
Support contains 68 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 764 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 764 transition count 2084
Applied a total of 32 rules in 74 ms. Remains 764 /780 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-28 15:24:50] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-05-28 15:24:50] [INFO ] Computed 46 invariants in 44 ms
[2024-05-28 15:24:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 41 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 15:25:20] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 24 ms to minimize.
[2024-05-28 15:25:20] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:25:21] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 1 ms to minimize.
[2024-05-28 15:25:21] [INFO ] Deduced a trap composed of 82 places in 635 ms of which 11 ms to minimize.
[2024-05-28 15:25:21] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 1 ms to minimize.
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 1 ms to minimize.
[2024-05-28 15:25:23] [INFO ] Deduced a trap composed of 404 places in 571 ms of which 13 ms to minimize.
[2024-05-28 15:25:24] [INFO ] Deduced a trap composed of 203 places in 581 ms of which 7 ms to minimize.
[2024-05-28 15:25:24] [INFO ] Deduced a trap composed of 185 places in 331 ms of which 4 ms to minimize.
[2024-05-28 15:25:24] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 1 ms to minimize.
[2024-05-28 15:25:25] [INFO ] Deduced a trap composed of 491 places in 357 ms of which 4 ms to minimize.
[2024-05-28 15:25:26] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 2 ms to minimize.
[2024-05-28 15:25:27] [INFO ] Deduced a trap composed of 427 places in 393 ms of which 4 ms to minimize.
[2024-05-28 15:25:28] [INFO ] Deduced a trap composed of 442 places in 413 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 56 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 49348ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49385ms
[2024-05-28 15:25:39] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:25:39] [INFO ] Invariant cache hit.
[2024-05-28 15:25:40] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-28 15:25:40] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:25:40] [INFO ] Invariant cache hit.
[2024-05-28 15:25:41] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:25:54] [INFO ] Implicit Places using invariants and state equation in 14547 ms returned []
Implicit Place search using SMT with State Equation took 15249 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-05-28 15:25:54] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:25:54] [INFO ] Invariant cache hit.
[2024-05-28 15:25:54] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 15:26:22] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:26:22] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:26:22] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 450 places in 327 ms of which 4 ms to minimize.
[2024-05-28 15:26:24] [INFO ] Deduced a trap composed of 178 places in 296 ms of which 4 ms to minimize.
[2024-05-28 15:26:24] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 0 ms to minimize.
[2024-05-28 15:26:25] [INFO ] Deduced a trap composed of 441 places in 369 ms of which 4 ms to minimize.
[2024-05-28 15:26:27] [INFO ] Deduced a trap composed of 435 places in 402 ms of which 4 ms to minimize.
[2024-05-28 15:26:27] [INFO ] Deduced a trap composed of 450 places in 400 ms of which 4 ms to minimize.
[2024-05-28 15:26:28] [INFO ] Deduced a trap composed of 442 places in 498 ms of which 6 ms to minimize.
[2024-05-28 15:26:33] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 56 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 15:26:48] [INFO ] Deduced a trap composed of 476 places in 407 ms of which 5 ms to minimize.
[2024-05-28 15:26:52] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 3 ms to minimize.
[2024-05-28 15:26:53] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 59 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 18/18 constraints]
After SMT, in 69141ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 69178ms
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133902 ms. Remains : 764/780 places, 2084/2100 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J06T08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T08-LTLCardinality-00 finished in 134302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(p1)&&G(p2))))'
Support contains 101 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 764 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 764 transition count 2084
Applied a total of 32 rules in 66 ms. Remains 764 /780 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-28 15:27:04] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:27:04] [INFO ] Invariant cache hit.
[2024-05-28 15:27:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 41 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:27:34] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:27:35] [INFO ] Deduced a trap composed of 187 places in 424 ms of which 6 ms to minimize.
[2024-05-28 15:27:35] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 3 ms to minimize.
[2024-05-28 15:27:37] [INFO ] Deduced a trap composed of 392 places in 503 ms of which 6 ms to minimize.
[2024-05-28 15:27:37] [INFO ] Deduced a trap composed of 439 places in 496 ms of which 5 ms to minimize.
[2024-05-28 15:27:39] [INFO ] Deduced a trap composed of 451 places in 583 ms of which 6 ms to minimize.
[2024-05-28 15:27:40] [INFO ] Deduced a trap composed of 458 places in 537 ms of which 6 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 458 places in 530 ms of which 11 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 450 places in 440 ms of which 4 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 464 places in 577 ms of which 5 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 443 places in 482 ms of which 4 ms to minimize.
[2024-05-28 15:27:43] [INFO ] Deduced a trap composed of 443 places in 413 ms of which 5 ms to minimize.
[2024-05-28 15:27:43] [INFO ] Deduced a trap composed of 442 places in 412 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 60 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 19/19 constraints]
After SMT, in 48560ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48588ms
[2024-05-28 15:27:52] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:27:52] [INFO ] Invariant cache hit.
[2024-05-28 15:27:53] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-28 15:27:53] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:27:53] [INFO ] Invariant cache hit.
[2024-05-28 15:27:54] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:28:12] [INFO ] Implicit Places using invariants and state equation in 19091 ms returned []
Implicit Place search using SMT with State Equation took 19634 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-05-28 15:28:12] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:28:12] [INFO ] Invariant cache hit.
[2024-05-28 15:28:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 15:28:40] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:28:40] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:28:41] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:28:41] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:28:41] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 4 ms to minimize.
[2024-05-28 15:28:41] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:28:41] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:28:42] [INFO ] Deduced a trap composed of 450 places in 380 ms of which 6 ms to minimize.
[2024-05-28 15:28:42] [INFO ] Deduced a trap composed of 178 places in 467 ms of which 5 ms to minimize.
[2024-05-28 15:28:43] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:28:44] [INFO ] Deduced a trap composed of 441 places in 430 ms of which 5 ms to minimize.
[2024-05-28 15:28:46] [INFO ] Deduced a trap composed of 435 places in 521 ms of which 5 ms to minimize.
[2024-05-28 15:28:46] [INFO ] Deduced a trap composed of 450 places in 509 ms of which 5 ms to minimize.
[2024-05-28 15:28:47] [INFO ] Deduced a trap composed of 442 places in 460 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 55 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 55 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 14/14 constraints]
After SMT, in 68870ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68889ms
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137191 ms. Remains : 764/780 places, 2084/2100 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T08-LTLCardinality-02
Product exploration explored 100000 steps with 10328 reset in 743 ms.
Product exploration explored 100000 steps with 10343 reset in 697 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 168 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-28 15:29:23] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 15:29:23] [INFO ] Invariant cache hit.
[2024-05-28 15:29:25] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 15:29:25] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 191 ms returned sat
[2024-05-28 15:29:26] [INFO ] [Real]Absence check using state equation in 1512 ms returned sat
[2024-05-28 15:29:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:29:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 15:29:28] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 181 ms returned sat
[2024-05-28 15:29:31] [INFO ] [Nat]Absence check using state equation in 3096 ms returned sat
[2024-05-28 15:29:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:29:32] [INFO ] [Nat]Added 160 Read/Feed constraints in 1047 ms returned sat
[2024-05-28 15:29:32] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 788 ms
[2024-05-28 15:29:33] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 221 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 15:29:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 57 out of 764 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 764 transition count 2052
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 732 transition count 2036
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 96 place count 716 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 716 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 288 place count 620 transition count 1940
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 432 place count 548 transition count 1868
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 440 place count 540 transition count 1860
Iterating global reduction 3 with 8 rules applied. Total rules applied 448 place count 540 transition count 1860
Applied a total of 448 rules in 241 ms. Remains 540 /764 variables (removed 224) and now considering 1860/2084 (removed 224) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 15:29:42] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 540 cols
[2024-05-28 15:29:42] [INFO ] Computed 46 invariants in 35 ms
[2024-05-28 15:29:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 1 ms to minimize.
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:30:03] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:30:04] [INFO ] Deduced a trap composed of 245 places in 308 ms of which 3 ms to minimize.
[2024-05-28 15:30:05] [INFO ] Deduced a trap composed of 264 places in 293 ms of which 3 ms to minimize.
[2024-05-28 15:30:05] [INFO ] Deduced a trap composed of 259 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:30:05] [INFO ] Deduced a trap composed of 264 places in 302 ms of which 3 ms to minimize.
[2024-05-28 15:30:06] [INFO ] Deduced a trap composed of 239 places in 306 ms of which 3 ms to minimize.
[2024-05-28 15:30:06] [INFO ] Deduced a trap composed of 240 places in 308 ms of which 3 ms to minimize.
[2024-05-28 15:30:06] [INFO ] Deduced a trap composed of 247 places in 310 ms of which 3 ms to minimize.
[2024-05-28 15:30:07] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/2368 variables, and 57 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1856/1856 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 15:30:13] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:30:17] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/2368 variables, and 59 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1856 constraints, Known Traps: 17/17 constraints]
After SMT, in 48516ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 48539ms
[2024-05-28 15:30:30] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
[2024-05-28 15:30:30] [INFO ] Invariant cache hit.
[2024-05-28 15:30:31] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-28 15:30:31] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
[2024-05-28 15:30:31] [INFO ] Invariant cache hit.
[2024-05-28 15:30:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:30:41] [INFO ] Implicit Places using invariants and state equation in 10421 ms returned []
Implicit Place search using SMT with State Equation took 10861 ms to find 0 implicit places.
[2024-05-28 15:30:41] [INFO ] Redundant transitions in 85 ms returned []
Running 1856 sub problems to find dead transitions.
[2024-05-28 15:30:41] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
[2024-05-28 15:30:41] [INFO ] Invariant cache hit.
[2024-05-28 15:30:41] [INFO ] State equation strengthened by 160 read => feed constraints.

BK_STOP 1716910249347

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="LTLCardinality"
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 PolyORBLF-COL-S04J06T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446500155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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