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

About the Execution of ITS-Tools for PolyORBNT-PT-S10J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 440667.00 0.00 0.00 FTFFF?F?FTF???FF 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-171654447300507.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 PolyORBNT-PT-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716934246578

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 22:10:47] [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 22:10:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:10:48] [INFO ] Load time of PNML (sax parser for PT used): 690 ms
[2024-05-28 22:10:48] [INFO ] Transformed 1234 places.
[2024-05-28 22:10:48] [INFO ] Transformed 12920 transitions.
[2024-05-28 22:10:48] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 968 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 151 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Applied a total of 10 rules in 316 ms. Remains 1224 /1234 variables (removed 10) and now considering 2810/2810 (removed 0) transitions.
Running 2799 sub problems to find dead transitions.
[2024-05-28 22:10:49] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1224 cols
[2024-05-28 22:10:50] [INFO ] Computed 142 invariants in 367 ms
[2024-05-28 22:10:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 42429ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 42535ms
[2024-05-28 22:11:32] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:11:32] [INFO ] Invariant cache hit.
[2024-05-28 22:11:34] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2024-05-28 22:11:34] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:11:34] [INFO ] Invariant cache hit.
[2024-05-28 22:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:11:53] [INFO ] Implicit Places using invariants and state equation in 19085 ms returned []
Implicit Place search using SMT with State Equation took 21018 ms to find 0 implicit places.
Running 2799 sub problems to find dead transitions.
[2024-05-28 22:11:53] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:11:53] [INFO ] Invariant cache hit.
[2024-05-28 22:11:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 53277ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 53312ms
Starting structural reductions in LTL mode, iteration 1 : 1224/1234 places, 2810/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117358 ms. Remains : 1224/1234 places, 2810/2810 transitions.
Support contains 151 out of 1224 places after structural reductions.
[2024-05-28 22:12:47] [INFO ] Flatten gal took : 306 ms
[2024-05-28 22:12:47] [INFO ] Flatten gal took : 162 ms
[2024-05-28 22:12:47] [INFO ] Input system was already deterministic with 2810 transitions.
RANDOM walk for 40000 steps (2232 resets) in 2867 ms. (13 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40002 steps (417 resets) in 353 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (420 resets) in 432 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (418 resets) in 398 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (419 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (417 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (417 resets) in 208 ms. (191 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (418 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (416 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (422 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
[2024-05-28 22:12:49] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:12:49] [INFO ] Invariant cache hit.
[2024-05-28 22:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 1088/1158 variables, 120/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 64/1222 variables, 21/141 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 0/141 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1223 variables, 1/142 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 0/142 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4024/4025 variables, and 1365 constraints, problems are : Problem set: 8 solved, 1 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1223/1224 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/201 variables, 2/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 336/537 variables, 56/59 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/59 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 560/1097 variables, 56/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 120/1217 variables, 21/136 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1217 variables, 0/136 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/1223 variables, 6/142 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1223 variables, 0/142 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4024/4025 variables, and 1365 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1223/1224 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 6710ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 2 out of 1224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1224/1224 places, 2810/2810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2744
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2679
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2676
Applied a total of 268 rules in 614 ms. Remains 1090 /1224 variables (removed 134) and now considering 2676/2810 (removed 134) transitions.
Running 2665 sub problems to find dead transitions.
[2024-05-28 22:12:57] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2024-05-28 22:12:57] [INFO ] Computed 142 invariants in 68 ms
[2024-05-28 22:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 40441ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 40485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41109 ms. Remains : 1090/1224 places, 2676/2810 transitions.
RANDOM walk for 5391 steps (389 resets) in 822 ms. (6 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S10J60-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' '!(F((G(F(p0))||(F(p0)&&G(p1)))))'
Support contains 73 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2810/2810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2744
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2680
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 1093 transition count 2679
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2679
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2677
Applied a total of 266 rules in 268 ms. Remains 1091 /1224 variables (removed 133) and now considering 2677/2810 (removed 133) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:13:38] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-28 22:13:38] [INFO ] Computed 142 invariants in 66 ms
[2024-05-28 22:13:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 43070ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 43094ms
[2024-05-28 22:14:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:21] [INFO ] Invariant cache hit.
[2024-05-28 22:14:23] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2024-05-28 22:14:23] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:23] [INFO ] Invariant cache hit.
[2024-05-28 22:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:14:53] [INFO ] Implicit Places using invariants and state equation in 29892 ms returned []
Implicit Place search using SMT with State Equation took 31546 ms to find 0 implicit places.
[2024-05-28 22:14:53] [INFO ] Redundant transitions in 239 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:14:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:14:53] [INFO ] Invariant cache hit.
[2024-05-28 22:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51537ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2677/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126736 ms. Remains : 1091/1224 places, 2677/2810 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLCardinality-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 7 ms.
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLCardinality-02 finished in 126997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2810/2810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2744
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2680
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 1093 transition count 2679
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2679
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2677
Applied a total of 266 rules in 360 ms. Remains 1091 /1224 variables (removed 133) and now considering 2677/2810 (removed 133) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:15:45] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-28 22:15:45] [INFO ] Computed 142 invariants in 47 ms
[2024-05-28 22:15:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 40812ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 40842ms
[2024-05-28 22:16:26] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:16:26] [INFO ] Invariant cache hit.
[2024-05-28 22:16:28] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2024-05-28 22:16:28] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:16:28] [INFO ] Invariant cache hit.
[2024-05-28 22:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:16:59] [INFO ] Performed 1025/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 22:17:01] [INFO ] Implicit Places using invariants and state equation in 33210 ms returned []
Implicit Place search using SMT with State Equation took 35069 ms to find 0 implicit places.
[2024-05-28 22:17:01] [INFO ] Redundant transitions in 89 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 22:17:01] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 22:17:01] [INFO ] Invariant cache hit.
[2024-05-28 22:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51940ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2677/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128350 ms. Remains : 1091/1224 places, 2677/2810 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J60-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 90 steps with 7 reset in 4 ms.
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J60-LTLCardinality-03 finished in 128476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U !p0)))'
Support contains 61 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2810/2810 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2809
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2809
Applied a total of 2 rules in 94 ms. Remains 1223 /1224 variables (removed 1) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 22:17:53] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
// Phase 1: matrix 2800 rows 1223 cols
[2024-05-28 22:17:53] [INFO ] Computed 142 invariants in 51 ms
[2024-05-28 22:17:53] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716934687245

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

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