Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700275.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-PT-S04J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 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 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.3M 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-PT-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716917664887

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 17:34:26] [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 17:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:34:26] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-05-28 17:34:26] [INFO ] Transformed 712 places.
[2024-05-28 17:34:26] [INFO ] Transformed 4012 transitions.
[2024-05-28 17:34:26] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 701 transition count 1837
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 701 transition count 1837
Applied a total of 18 rules in 213 ms. Remains 701 /712 variables (removed 11) and now considering 1837/1844 (removed 7) transitions.
Running 1833 sub problems to find dead transitions.
[2024-05-28 17:34:27] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 701 cols
[2024-05-28 17:34:27] [INFO ] Computed 50 invariants in 141 ms
[2024-05-28 17:34:27] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 75 places in 251 ms of which 32 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 74 places in 450 ms of which 3 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 75 places in 368 ms of which 19 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 75 places in 369 ms of which 1 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 343 places in 1107 ms of which 24 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 368 places in 369 ms of which 4 ms to minimize.
SMT process timed out in 30153ms, After SMT, problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 30254ms
[2024-05-28 17:34:57] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
[2024-05-28 17:34:57] [INFO ] Invariant cache hit.
[2024-05-28 17:34:58] [INFO ] Implicit Places using invariants in 700 ms returned [142, 229, 252, 352, 475, 540, 553, 680]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 724 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 693/712 places, 1837/1844 transitions.
Applied a total of 0 rules in 22 ms. Remains 693 /693 variables (removed 0) and now considering 1837/1837 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31309 ms. Remains : 693/712 places, 1837/1844 transitions.
Support contains 171 out of 693 places after structural reductions.
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 237 ms
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 144 ms
[2024-05-28 17:34:59] [INFO ] Input system was already deterministic with 1837 transitions.
Support contains 124 out of 693 places (down from 171) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 1537 ms. (26 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 495 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 6/6 properties
[2024-05-28 17:35:00] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 693 cols
[2024-05-28 17:35:00] [INFO ] Computed 42 invariants in 33 ms
[2024-05-28 17:35:00] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/68 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/76 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 116/192 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 473/665 variables, 17/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 9 (OVERLAPS) 14/679 variables, 7/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 693/2498 variables, and 42 constraints, problems are : Problem set: 6 solved, 0 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 693 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 1837/1837 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 685 transition count 1829
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 685 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 684 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 684 transition count 1828
Applied a total of 18 rules in 77 ms. Remains 684 /693 variables (removed 9) and now considering 1828/1837 (removed 9) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 17:35:01] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 17:35:01] [INFO ] Computed 42 invariants in 79 ms
[2024-05-28 17:35:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:35:24] [INFO ] Deduced a trap composed of 75 places in 770 ms of which 1 ms to minimize.
[2024-05-28 17:35:24] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 1 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 0 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 0 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 75 places in 304 ms of which 0 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 54 places in 358 ms of which 4 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 3 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 342 places in 341 ms of which 3 ms to minimize.
[2024-05-28 17:35:28] [INFO ] Deduced a trap composed of 81 places in 227 ms of which 2 ms to minimize.
[2024-05-28 17:35:29] [INFO ] Deduced a trap composed of 194 places in 326 ms of which 3 ms to minimize.
[2024-05-28 17:35:30] [INFO ] Deduced a trap composed of 378 places in 559 ms of which 4 ms to minimize.
SMT process timed out in 28483ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 28501ms
[2024-05-28 17:35:30] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:35:30] [INFO ] Invariant cache hit.
[2024-05-28 17:35:30] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-05-28 17:35:30] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:35:30] [INFO ] Invariant cache hit.
[2024-05-28 17:35:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:36:01] [INFO ] Performed 605/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 17:36:04] [INFO ] Implicit Places using invariants and state equation in 33490 ms returned []
Implicit Place search using SMT with State Equation took 34189 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 17:36:04] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:36:04] [INFO ] Invariant cache hit.
[2024-05-28 17:36:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 2 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:36:29] [INFO ] Deduced a trap composed of 341 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:36:30] [INFO ] Deduced a trap composed of 407 places in 315 ms of which 3 ms to minimize.
[2024-05-28 17:36:31] [INFO ] Deduced a trap composed of 347 places in 324 ms of which 3 ms to minimize.
[2024-05-28 17:36:32] [INFO ] Deduced a trap composed of 186 places in 316 ms of which 3 ms to minimize.
[2024-05-28 17:36:32] [INFO ] Deduced a trap composed of 212 places in 347 ms of which 17 ms to minimize.
[2024-05-28 17:36:32] [INFO ] Deduced a trap composed of 201 places in 331 ms of which 4 ms to minimize.
[2024-05-28 17:36:33] [INFO ] Deduced a trap composed of 201 places in 323 ms of which 4 ms to minimize.
[2024-05-28 17:36:34] [INFO ] Deduced a trap composed of 381 places in 330 ms of which 3 ms to minimize.
[2024-05-28 17:36:34] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 2 ms to minimize.
[2024-05-28 17:36:35] [INFO ] Deduced a trap composed of 342 places in 311 ms of which 4 ms to minimize.
[2024-05-28 17:36:36] [INFO ] Deduced a trap composed of 398 places in 293 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:36:39] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 4 ms to minimize.
[2024-05-28 17:36:40] [INFO ] Deduced a trap composed of 365 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:37:02] [INFO ] Deduced a trap composed of 461 places in 523 ms of which 5 ms to minimize.
[2024-05-28 17:37:02] [INFO ] Deduced a trap composed of 410 places in 390 ms of which 4 ms to minimize.
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 385 places in 441 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 63 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 25/25 constraints]
After SMT, in 69134ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69149ms
Starting structural reductions in LTL mode, iteration 1 : 684/693 places, 1828/1837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131936 ms. Remains : 684/693 places, 1828/1837 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 1287 ms.
Product exploration explored 100000 steps with 25000 reset in 1016 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 384 steps (0 resets) in 7 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 13 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 17:37:17] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:37:17] [INFO ] Invariant cache hit.
[2024-05-28 17:37:17] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 0 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:37:40] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:37:41] [INFO ] Deduced a trap composed of 341 places in 353 ms of which 10 ms to minimize.
[2024-05-28 17:37:42] [INFO ] Deduced a trap composed of 407 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:37:43] [INFO ] Deduced a trap composed of 347 places in 356 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 (/ 1.0 2.0))
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 9.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 17:37:59] [INFO ] Deduced a trap composed of 82 places in 339 ms of which 2 ms to minimize.
[2024-05-28 17:38:01] [INFO ] Deduced a trap composed of 373 places in 322 ms of which 3 ms to minimize.
[2024-05-28 17:38:01] [INFO ] Deduced a trap composed of 343 places in 306 ms of which 3 ms to minimize.
[2024-05-28 17:38:02] [INFO ] Deduced a trap composed of 54 places in 311 ms of which 3 ms to minimize.
[2024-05-28 17:38:02] [INFO ] Deduced a trap composed of 185 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 46447ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 46519ms
[2024-05-28 17:38:03] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:38:03] [INFO ] Invariant cache hit.
[2024-05-28 17:38:04] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 17:38:04] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:38:04] [INFO ] Invariant cache hit.
[2024-05-28 17:38:04] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:38:35] [INFO ] Performed 665/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 17:38:35] [INFO ] Implicit Places using invariants and state equation in 31106 ms returned []
Implicit Place search using SMT with State Equation took 31779 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 17:38:35] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:38:35] [INFO ] Invariant cache hit.
[2024-05-28 17:38:35] [INFO ] State equation strengthened by 160 read => feed constraints.

BK_STOP 1716917938206

--------------------
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-PT-S04J04T08"
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-PT-S04J04T08, 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-171654446700275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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