Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600300.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 greatspnxred
Input is PolyORBLF-PT-S04J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 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.5M 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-S04J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716867278240

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:34:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 03:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:34:40] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2024-05-28 03:34:40] [INFO ] Transformed 792 places.
[2024-05-28 03:34:40] [INFO ] Transformed 4268 transitions.
[2024-05-28 03:34:40] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 696 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 265 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-05-28 03:34:41] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-05-28 03:34:41] [INFO ] Computed 54 invariants in 259 ms
[2024-05-28 03:34:41] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 45 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-28 03:35:14] [INFO ] Deduced a trap composed of 138 places in 373 ms of which 32 ms to minimize.
[2024-05-28 03:35:15] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 2 ms to minimize.
[2024-05-28 03:35:26] [INFO ] Deduced a trap composed of 83 places in 695 ms of which 11 ms to minimize.
[2024-05-28 03:35:26] [INFO ] Deduced a trap composed of 41 places in 477 ms of which 4 ms to minimize.
[2024-05-28 03:35:27] [INFO ] Deduced a trap composed of 82 places in 460 ms of which 5 ms to minimize.
[2024-05-28 03:35:27] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 4 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 83 places in 353 ms of which 3 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:35:29] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 56 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 11/11 constraints]
After SMT, in 51230ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 51356ms
[2024-05-28 03:35:32] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 03:35:32] [INFO ] Invariant cache hit.
[2024-05-28 03:35:33] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-28 03:35:33] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 03:35:33] [INFO ] Invariant cache hit.
[2024-05-28 03:35:37] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 03:36:06] [INFO ] Implicit Places using invariants and state equation in 33556 ms returned []
Implicit Place search using SMT with State Equation took 34421 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-05-28 03:36:06] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 03:36:06] [INFO ] Invariant cache hit.
[2024-05-28 03:36:07] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-28 03:36:36] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-28 03:36:43] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 47 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-28 03:36:56] [INFO ] Deduced a trap composed of 98 places in 435 ms of which 4 ms to minimize.
[2024-05-28 03:36:57] [INFO ] Deduced a trap composed of 83 places in 431 ms of which 4 ms to minimize.
[2024-05-28 03:36:57] [INFO ] Deduced a trap composed of 82 places in 381 ms of which 4 ms to minimize.
[2024-05-28 03:36:57] [INFO ] Deduced a trap composed of 82 places in 303 ms of which 3 ms to minimize.
[2024-05-28 03:36:58] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 3 ms to minimize.
[2024-05-28 03:36:58] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-28 03:36:58] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:36:58] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-05-28 03:36:58] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-28 03:36:59] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 57 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 12/12 constraints]
After SMT, in 69573ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 69615ms
Starting structural reductions in LTL mode, iteration 1 : 780/792 places, 2092/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155799 ms. Remains : 780/792 places, 2092/2100 transitions.
Support contains 171 out of 780 places after structural reductions.
[2024-05-28 03:37:17] [INFO ] Flatten gal took : 247 ms
[2024-05-28 03:37:17] [INFO ] Flatten gal took : 154 ms
[2024-05-28 03:37:17] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 163 out of 780 places (down from 171) after GAL structural reductions.
RANDOM walk for 13379 steps (2 resets) in 530 ms. (25 steps per ms) remains 0/19 properties
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 780 transition count 2052
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 740 transition count 2044
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 432 place count 564 transition count 1876
Applied a total of 432 rules in 338 ms. Remains 564 /780 variables (removed 216) and now considering 1876/2092 (removed 216) transitions.
Running 1872 sub problems to find dead transitions.
[2024-05-28 03:37:18] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-05-28 03:37:18] [INFO ] Computed 54 invariants in 106 ms
[2024-05-28 03:37:18] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-28 03:37:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 39 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/564 variables, 16/55 constraints. Problems are: Problem set: 139 solved, 1733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/2408 variables, and 55 constraints, problems are : Problem set: 139 solved, 1733 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 1/1 constraints]
After SMT, in 49136ms problems are : Problem set: 139 solved, 1733 unsolved
Search for dead transitions found 139 dead transitions in 49199ms
Found 139 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 139 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 139 transitions.
[2024-05-28 03:38:07] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
// Phase 1: matrix 1705 rows 564 cols
[2024-05-28 03:38:07] [INFO ] Computed 54 invariants in 81 ms
[2024-05-28 03:38:08] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-28 03:38:08] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:38:08] [INFO ] Invariant cache hit.
[2024-05-28 03:38:10] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 03:38:40] [INFO ] Performed 366/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:38:55] [INFO ] Implicit Places using invariants and state equation in 47072 ms returned []
Implicit Place search using SMT with State Equation took 47881 ms to find 0 implicit places.
[2024-05-28 03:38:55] [INFO ] Redundant transitions in 139 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 564/780 places, 1737/2092 transitions.
Applied a total of 0 rules in 47 ms. Remains 564 /564 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97646 ms. Remains : 564/780 places, 1737/2092 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-03
Product exploration explored 100000 steps with 3667 reset in 959 ms.
Product exploration explored 100000 steps with 3616 reset in 717 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
RANDOM walk for 90 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2024-05-28 03:38:58] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:38:58] [INFO ] Invariant cache hit.
[2024-05-28 03:38:59] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 03:38:59] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 122 ms returned sat
[2024-05-28 03:39:06] [INFO ] [Real]Absence check using state equation in 6761 ms returned unknown
Could not prove EG (NOT p0)
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1737/1737 transitions.
Applied a total of 0 rules in 50 ms. Remains 564 /564 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
Running 1733 sub problems to find dead transitions.
[2024-05-28 03:39:06] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:39:06] [INFO ] Invariant cache hit.
[2024-05-28 03:39:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:39:24] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-28 03:39:25] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2269 variables, and 47 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1733/1733 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:39:34] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 3 ms to minimize.
[2024-05-28 03:39:34] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 2 ms to minimize.
[2024-05-28 03:39:34] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:39:34] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:39:35] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 4 ms to minimize.
[2024-05-28 03:39:35] [INFO ] Deduced a trap composed of 56 places in 357 ms of which 3 ms to minimize.
[2024-05-28 03:39:36] [INFO ] Deduced a trap composed of 85 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:39:36] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:39:36] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:39:36] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-28 03:39:37] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-05-28 03:39:44] [INFO ] Deduced a trap composed of 202 places in 282 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2269 variables, and 59 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1733 constraints, Known Traps: 14/14 constraints]
After SMT, in 46006ms problems are : Problem set: 0 solved, 1733 unsolved
Search for dead transitions found 0 dead transitions in 46027ms
[2024-05-28 03:39:52] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:39:52] [INFO ] Invariant cache hit.
[2024-05-28 03:39:52] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 03:39:52] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:39:52] [INFO ] Invariant cache hit.
[2024-05-28 03:39:54] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 03:40:24] [INFO ] Performed 441/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:40:35] [INFO ] Implicit Places using invariants and state equation in 42680 ms returned []
Implicit Place search using SMT with State Equation took 43272 ms to find 0 implicit places.
[2024-05-28 03:40:35] [INFO ] Redundant transitions in 107 ms returned []
Running 1733 sub problems to find dead transitions.
[2024-05-28 03:40:35] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:40:35] [INFO ] Invariant cache hit.
[2024-05-28 03:40:35] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:40:54] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-28 03:40:55] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2269 variables, and 47 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1733/1733 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:41:14] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 3 ms to minimize.
[2024-05-28 03:41:14] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 2 ms to minimize.
[2024-05-28 03:41:14] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:41:14] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:41:15] [INFO ] Deduced a trap composed of 55 places in 314 ms of which 2 ms to minimize.
[2024-05-28 03:41:15] [INFO ] Deduced a trap composed of 56 places in 351 ms of which 15 ms to minimize.
[2024-05-28 03:41:16] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 3 ms to minimize.
[2024-05-28 03:41:16] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2024-05-28 03:41:16] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-28 03:41:16] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2024-05-28 03:41:17] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-28 03:41:23] [INFO ] Deduced a trap composed of 202 places in 283 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:41:34] [INFO ] Deduced a trap composed of 85 places in 274 ms of which 3 ms to minimize.
[2024-05-28 03:41:34] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 3 ms to minimize.
[2024-05-28 03:41:35] [INFO ] Deduced a trap composed of 103 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:41:35] [INFO ] Deduced a trap composed of 103 places in 250 ms of which 3 ms to minimize.
[2024-05-28 03:41:35] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 10 ms to minimize.
[2024-05-28 03:41:36] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 2 ms to minimize.
[2024-05-28 03:41:36] [INFO ] Deduced a trap composed of 79 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2269 variables, and 66 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1733 constraints, Known Traps: 21/21 constraints]
After SMT, in 66681ms problems are : Problem set: 0 solved, 1733 unsolved
Search for dead transitions found 0 dead transitions in 66701ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156193 ms. Remains : 564/564 places, 1737/1737 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 139 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2024-05-28 03:41:42] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:41:42] [INFO ] Invariant cache hit.
[2024-05-28 03:41:43] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 03:41:43] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 117 ms returned sat
[2024-05-28 03:41:50] [INFO ] [Real]Absence check using state equation in 6671 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3632 reset in 637 ms.
Product exploration explored 100000 steps with 3600 reset in 655 ms.
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1737/1737 transitions.
Applied a total of 0 rules in 59 ms. Remains 564 /564 variables (removed 0) and now considering 1737/1737 (removed 0) transitions.
Running 1733 sub problems to find dead transitions.
[2024-05-28 03:41:51] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:41:51] [INFO ] Invariant cache hit.
[2024-05-28 03:41:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:42:10] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-28 03:42:11] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2269 variables, and 47 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1733/1733 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
[2024-05-28 03:42:18] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 3 ms to minimize.
[2024-05-28 03:42:18] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 2 ms to minimize.
[2024-05-28 03:42:19] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-28 03:42:19] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2024-05-28 03:42:19] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 3 ms to minimize.
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 4 ms to minimize.
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 85 places in 269 ms of which 3 ms to minimize.
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 0 ms to minimize.
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:42:21] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2024-05-28 03:42:28] [INFO ] Deduced a trap composed of 202 places in 290 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 2)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 4)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 7)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 2)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 2)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 4)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 2)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 3)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 4)
(s188 0)
(s189 3)
(s190 0)
(s191 3)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 4)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 3)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 4)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 2)
(s273 0)
(s274 0)
(s275 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2269 variables, and 59 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1733 constraints, Known Traps: 14/14 constraints]
After SMT, in 45135ms problems are : Problem set: 0 solved, 1733 unsolved
Search for dead transitions found 0 dead transitions in 45151ms
[2024-05-28 03:42:36] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:42:36] [INFO ] Invariant cache hit.
[2024-05-28 03:42:37] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-28 03:42:37] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:42:37] [INFO ] Invariant cache hit.
[2024-05-28 03:42:39] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 03:43:09] [INFO ] Performed 407/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:43:21] [INFO ] Implicit Places using invariants and state equation in 43515 ms returned []
Implicit Place search using SMT with State Equation took 44192 ms to find 0 implicit places.
[2024-05-28 03:43:21] [INFO ] Redundant transitions in 89 ms returned []
Running 1733 sub problems to find dead transitions.
[2024-05-28 03:43:21] [INFO ] Flow matrix only has 1705 transitions (discarded 32 similar events)
[2024-05-28 03:43:21] [INFO ] Invariant cache hit.
[2024-05-28 03:43:21] [INFO ] State equation strengthened by 160 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 792
TRANSITIONS: 4268
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.209s, Sys 0.013s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.028s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 973
MODEL NAME: /home/mcc/execution/model
792 places, 4268 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

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-S04J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;