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-171654445400204.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-COL-S06J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 17:16 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716857898913

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 00:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:58:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 00:58:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:58:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 989 ms
[2024-05-28 00:58:21] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:58:21] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 00:58:21] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 40000 steps (3882 resets) in 1458 ms. (27 steps per ms) remains 9/20 properties
BEST_FIRST walk for 40002 steps (78 resets) in 337 ms. (118 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (168 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-28 00:58:22] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:58:22] [INFO ] Computed 26 invariants in 14 ms
[2024-05-28 00:58:22] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 21 constraints, problems are : Problem set: 1 solved, 0 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-28 00:58:22] [INFO ] Flatten gal took : 64 ms
[2024-05-28 00:58:22] [INFO ] Flatten gal took : 11 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 00:58:23] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 425 ms.
[2024-05-28 00:58:23] [INFO ] Unfolded 10 HLPN properties in 0 ms.
[2024-05-28 00:58:23] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 00:58:23] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 179 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Applied a total of 18 rules in 236 ms. Remains 688 /700 variables (removed 12) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 00:58:24] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 688 cols
[2024-05-28 00:58:24] [INFO ] Computed 52 invariants in 148 ms
[2024-05-28 00:58:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 41888ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 41997ms
[2024-05-28 00:59:05] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 00:59:05] [INFO ] Invariant cache hit.
[2024-05-28 00:59:06] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-28 00:59:06] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 00:59:06] [INFO ] Invariant cache hit.
[2024-05-28 00:59:08] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:59:22] [INFO ] Implicit Places using invariants and state equation in 15595 ms returned []
Implicit Place search using SMT with State Equation took 16286 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-05-28 00:59:22] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 00:59:22] [INFO ] Invariant cache hit.
[2024-05-28 00:59:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 01:00:08] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 18 ms to minimize.
[2024-05-28 01:00:08] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-05-28 01:00:09] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 1 ms to minimize.
[2024-05-28 01:00:09] [INFO ] Deduced a trap composed of 93 places in 359 ms of which 1 ms to minimize.
[2024-05-28 01:00:09] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 14 ms to minimize.
[2024-05-28 01:00:22] [INFO ] Deduced a trap composed of 398 places in 11935 ms of which 5 ms to minimize.
SMT process timed out in 59943ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 59982ms
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118577 ms. Remains : 688/700 places, 2664/2670 transitions.
Support contains 179 out of 688 places after structural reductions.
[2024-05-28 01:00:22] [INFO ] Flatten gal took : 323 ms
[2024-05-28 01:00:23] [INFO ] Flatten gal took : 360 ms
[2024-05-28 01:00:23] [INFO ] Input system was already deterministic with 2664 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 40000 steps (217 resets) in 609 ms. (65 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40003 steps (113 resets) in 504 ms. (79 steps per ms) remains 1/1 properties
[2024-05-28 01:00:24] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 01:00:24] [INFO ] Invariant cache hit.
[2024-05-28 01:00:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 494/509 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/575 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 685/3316 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((X(X(X(p1))) U (p2&&X(X(X(p1))))))||p0))))'
Support contains 26 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 111 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:00:25] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 01:00:25] [INFO ] Computed 52 invariants in 119 ms
[2024-05-28 01:00:25] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 45989ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 46045ms
[2024-05-28 01:01:11] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:01:11] [INFO ] Invariant cache hit.
[2024-05-28 01:01:12] [INFO ] Implicit Places using invariants in 1360 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1370 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 23 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47572 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 1055 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-00
Stuttering criterion allowed to conclude after 67 steps with 1 reset in 23 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-00 finished in 48826 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(F(p0)))'
Support contains 12 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 688 transition count 2622
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 646 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 84 place count 646 transition count 2538
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 252 place count 562 transition count 2538
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 384 place count 496 transition count 2472
Applied a total of 384 rules in 444 ms. Remains 496 /688 variables (removed 192) and now considering 2472/2664 (removed 192) transitions.
Running 2466 sub problems to find dead transitions.
[2024-05-28 01:01:14] [INFO ] Flow matrix only has 2436 transitions (discarded 36 similar events)
// Phase 1: matrix 2436 rows 496 cols
[2024-05-28 01:01:14] [INFO ] Computed 52 invariants in 55 ms
[2024-05-28 01:01:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2932 variables, and 41 constraints, problems are : Problem set: 0 solved, 2466 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/496 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2466/1212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2466 unsolved
[2024-05-28 01:01:59] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 6 ms to minimize.
[2024-05-28 01:02:01] [INFO ] Deduced a trap composed of 60 places in 556 ms of which 3 ms to minimize.
[2024-05-28 01:02:01] [INFO ] Deduced a trap composed of 94 places in 537 ms of which 3 ms to minimize.
[2024-05-28 01:02:01] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 0 ms to minimize.
[2024-05-28 01:02:02] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:02:02] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:02:03] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 2 ms to minimize.
[2024-05-28 01:02:04] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 2 ms to minimize.
[2024-05-28 01:02:04] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2932 variables, and 50 constraints, problems are : Problem set: 0 solved, 2466 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/496 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1212 constraints, Known Traps: 9/9 constraints]
After SMT, in 63737ms problems are : Problem set: 0 solved, 2466 unsolved
Search for dead transitions found 0 dead transitions in 63776ms
[2024-05-28 01:02:18] [INFO ] Flow matrix only has 2436 transitions (discarded 36 similar events)
[2024-05-28 01:02:18] [INFO ] Invariant cache hit.
[2024-05-28 01:02:18] [INFO ] Implicit Places using invariants in 636 ms returned [426, 427, 428, 429, 430, 431]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 645 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 490/688 places, 2472/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 484 transition count 2466
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 484 transition count 2466
Applied a total of 12 rules in 74 ms. Remains 484 /490 variables (removed 6) and now considering 2466/2472 (removed 6) transitions.
[2024-05-28 01:02:18] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
// Phase 1: matrix 2430 rows 484 cols
[2024-05-28 01:02:18] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 01:02:19] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-28 01:02:19] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:02:19] [INFO ] Invariant cache hit.
[2024-05-28 01:02:20] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 01:02:29] [INFO ] Implicit Places using invariants and state equation in 9782 ms returned []
Implicit Place search using SMT with State Equation took 10531 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 484/688 places, 2466/2664 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75485 ms. Remains : 484/688 places, 2466/2664 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-01
Product exploration explored 100000 steps with 5573 reset in 1119 ms.
Product exploration explored 100000 steps with 5575 reset in 1012 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 56 steps (2 resets) in 8 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 2466/2466 transitions.
Applied a total of 0 rules in 52 ms. Remains 484 /484 variables (removed 0) and now considering 2466/2466 (removed 0) transitions.
Running 2460 sub problems to find dead transitions.
[2024-05-28 01:02:32] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:02:32] [INFO ] Invariant cache hit.
[2024-05-28 01:02:32] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
SMT process timed out in 44043ms, After SMT, problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 44079ms
[2024-05-28 01:03:16] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:03:16] [INFO ] Invariant cache hit.
[2024-05-28 01:03:16] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-28 01:03:16] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:03:16] [INFO ] Invariant cache hit.
[2024-05-28 01:03:17] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 01:03:26] [INFO ] Implicit Places using invariants and state equation in 10006 ms returned []
Implicit Place search using SMT with State Equation took 10689 ms to find 0 implicit places.
[2024-05-28 01:03:26] [INFO ] Redundant transitions in 111 ms returned []
Running 2460 sub problems to find dead transitions.
[2024-05-28 01:03:27] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:03:27] [INFO ] Invariant cache hit.
[2024-05-28 01:03:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 01:04:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2914 variables, and 36 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 01:04:39] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-28 01:04:40] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 2 ms to minimize.
[2024-05-28 01:04:40] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 0 ms to minimize.
[2024-05-28 01:04:41] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:04:43] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 1 ms to minimize.
[2024-05-28 01:04:43] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 42 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 7/7 constraints]
After SMT, in 81353ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 81380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 136336 ms. Remains : 484/484 places, 2466/2466 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 91 steps (4 resets) in 19 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5586 reset in 928 ms.
Product exploration explored 100000 steps with 5648 reset in 908 ms.
Support contains 12 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 2466/2466 transitions.
Applied a total of 0 rules in 40 ms. Remains 484 /484 variables (removed 0) and now considering 2466/2466 (removed 0) transitions.
Running 2460 sub problems to find dead transitions.
[2024-05-28 01:04:50] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:04:50] [INFO ] Invariant cache hit.
[2024-05-28 01:04:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 01:05:34] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2914 variables, and 36 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 36 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 1/1 constraints]
After SMT, in 63662ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 63687ms
[2024-05-28 01:05:54] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:05:54] [INFO ] Invariant cache hit.
[2024-05-28 01:05:55] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-28 01:05:55] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:05:55] [INFO ] Invariant cache hit.
[2024-05-28 01:05:55] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 01:06:04] [INFO ] Implicit Places using invariants and state equation in 8988 ms returned []
Implicit Place search using SMT with State Equation took 9553 ms to find 0 implicit places.
[2024-05-28 01:06:04] [INFO ] Redundant transitions in 72 ms returned []
Running 2460 sub problems to find dead transitions.
[2024-05-28 01:06:04] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 01:06:04] [INFO ] Invariant cache hit.
[2024-05-28 01:06:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 01:06:47] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 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 Real declared 478/2914 variables, and 36 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 01:07:18] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-28 01:07:18] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 2 ms to minimize.
[2024-05-28 01:07:18] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:07:20] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:07:21] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:07:21] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 42 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 7/7 constraints]
After SMT, in 83598ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 83625ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156999 ms. Remains : 484/484 places, 2466/2466 transitions.
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-01 finished in 374332 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((F(p0)&&F(G(p1)))))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 688 transition count 2646
Reduce places removed 18 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 30 rules applied. Total rules applied 48 place count 670 transition count 2634
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 60 place count 658 transition count 2634
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 60 place count 658 transition count 2544
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 240 place count 568 transition count 2544
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 360 place count 508 transition count 2484
Applied a total of 360 rules in 199 ms. Remains 508 /688 variables (removed 180) and now considering 2484/2664 (removed 180) transitions.
Running 2478 sub problems to find dead transitions.
[2024-05-28 01:07:28] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
// Phase 1: matrix 2448 rows 508 cols
[2024-05-28 01:07:28] [INFO ] Computed 52 invariants in 42 ms
[2024-05-28 01:07:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:08:06] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-28 01:08:07] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:08:08] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 2 ms to minimize.
[2024-05-28 01:08:08] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-28 01:08:08] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 5 ms to minimize.
[2024-05-28 01:08:08] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/2956 variables, and 52 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2478/1224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:08:13] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:08:14] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:08:19] [INFO ] Deduced a trap composed of 240 places in 500 ms of which 3 ms to minimize.
[2024-05-28 01:08:20] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:08:20] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/2956 variables, and 57 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1224 constraints, Known Traps: 11/11 constraints]
After SMT, in 61432ms problems are : Problem set: 0 solved, 2478 unsolved
Search for dead transitions found 0 dead transitions in 61457ms
[2024-05-28 01:08:29] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
[2024-05-28 01:08:29] [INFO ] Invariant cache hit.
[2024-05-28 01:08:30] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-28 01:08:30] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
[2024-05-28 01:08:30] [INFO ] Invariant cache hit.
[2024-05-28 01:08:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 01:08:42] [INFO ] Implicit Places using invariants and state equation in 11729 ms returned []
Implicit Place search using SMT with State Equation took 12401 ms to find 0 implicit places.
[2024-05-28 01:08:42] [INFO ] Redundant transitions in 137 ms returned []
Running 2478 sub problems to find dead transitions.
[2024-05-28 01:08:42] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
[2024-05-28 01:08:42] [INFO ] Invariant cache hit.
[2024-05-28 01:08:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:09:21] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-28 01:09:21] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:09:21] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-28 01:09:21] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:09:21] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 0 ms to minimize.
[2024-05-28 01:09:24] [INFO ] Deduced a trap composed of 240 places in 513 ms of which 4 ms to minimize.
[2024-05-28 01:09:27] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/2956 variables, and 53 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2478/1224 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:09:37] [INFO ] Deduced a trap composed of 70 places in 526 ms of which 4 ms to minimize.
[2024-05-28 01:09:41] [INFO ] Deduced a trap composed of 165 places in 528 ms of which 4 ms to minimize.
[2024-05-28 01:09:42] [INFO ] Deduced a trap composed of 15 places in 192 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 502/2956 variables, and 56 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1224 constraints, Known Traps: 10/10 constraints]
After SMT, in 81214ms problems are : Problem set: 0 solved, 2478 unsolved
Search for dead transitions found 0 dead transitions in 81244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 508/688 places, 2484/2664 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155467 ms. Remains : 508/688 places, 2484/2664 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-02
Stuttering criterion allowed to conclude after 281 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-02 finished in 155637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&(X(p3)||p2)))))'
Support contains 24 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 43 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:10:03] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 01:10:03] [INFO ] Computed 52 invariants in 104 ms
[2024-05-28 01:10:03] [INFO ] State equation strengthened by 168 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/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 47217ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 47248ms
[2024-05-28 01:10:51] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:10:51] [INFO ] Invariant cache hit.
[2024-05-28 01:10:51] [INFO ] Implicit Places using invariants in 785 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 793 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 15 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48109 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-03 finished in 48276 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(p0)&&X(G(p1)))))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 42 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:10:52] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:10:52] [INFO ] Invariant cache hit.
[2024-05-28 01:10:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 48026ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 48060ms
[2024-05-28 01:11:40] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:11:40] [INFO ] Invariant cache hit.
[2024-05-28 01:11:40] [INFO ] Implicit Places using invariants in 516 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 527 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 17 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48655 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-04 finished in 48836 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(p0)&&F(p1)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 52 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:11:40] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:11:40] [INFO ] Invariant cache hit.
[2024-05-28 01:11:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 45913ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 45948ms
[2024-05-28 01:12:26] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:12:26] [INFO ] Invariant cache hit.
[2024-05-28 01:12:27] [INFO ] Implicit Places using invariants in 790 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 802 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 20 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46831 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 249 steps with 1 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-09 finished in 47013 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(X(X(((X(p1) U p2)&&p0))))))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 58 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:12:27] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:12:27] [INFO ] Invariant cache hit.
[2024-05-28 01:12:27] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 10.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 6.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 43880ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 43921ms
[2024-05-28 01:13:11] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:13:11] [INFO ] Invariant cache hit.
[2024-05-28 01:13:12] [INFO ] Implicit Places using invariants in 796 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 804 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 17 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44810 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-10
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-10 finished in 45104 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(G(p0)))'
Support contains 6 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2658
Applied a total of 12 rules in 35 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 01:13:13] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:13:13] [INFO ] Invariant cache hit.
[2024-05-28 01:13:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 49813ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 49840ms
[2024-05-28 01:14:02] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 01:14:02] [INFO ] Invariant cache hit.
[2024-05-28 01:14:03] [INFO ] Implicit Places using invariants in 754 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 763 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2664 transitions.
Applied a total of 0 rules in 16 ms. Remains 676 /676 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50662 ms. Remains : 676/688 places, 2658/2664 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 49 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-12 finished in 50810 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' '!(((!p0 U p1)&&F(G(p2))))'
Support contains 25 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2664/2664 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 688 transition count 2640
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 664 transition count 2634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 658 transition count 2634
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 60 place count 658 transition count 2550
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 228 place count 574 transition count 2550
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 360 place count 508 transition count 2484
Applied a total of 360 rules in 225 ms. Remains 508 /688 variables (removed 180) and now considering 2484/2664 (removed 180) transitions.
Running 2478 sub problems to find dead transitions.
[2024-05-28 01:14:04] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
// Phase 1: matrix 2448 rows 508 cols
[2024-05-28 01:14:04] [INFO ] Computed 52 invariants in 81 ms
[2024-05-28 01:14:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:14:51] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:14:51] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-05-28 01:14:51] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:14:51] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:14:52] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:14:52] [INFO ] Deduced a trap composed of 222 places in 493 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/2956 variables, and 52 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2478/1224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-05-28 01:14:55] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:14:56] [INFO ] Deduced a trap composed of 266 places in 635 ms of which 4 ms to minimize.
[2024-05-28 01:14:57] [INFO ] Deduced a trap composed of 15 places in 669 ms of which 6 ms to minimize.
[2024-05-28 01:14:57] [INFO ] Deduced a trap composed of 226 places in 643 ms of which 5 ms to minimize.
[2024-05-28 01:14:58] [INFO ] Deduced a trap composed of 225 places in 614 ms of which 4 ms to minimize.
[2024-05-28 01:15:03] [INFO ] Deduced a trap composed of 240 places in 517 ms of which 4 ms to minimize.
[2024-05-28 01:15:05] [INFO ] Deduced a trap composed of 208 places in 587 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/2956 variables, and 59 constraints, problems are : Problem set: 0 solved, 2478 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/508 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1224 constraints, Known Traps: 13/13 constraints]
After SMT, in 68910ms problems are : Problem set: 0 solved, 2478 unsolved
Search for dead transitions found 0 dead transitions in 68947ms
[2024-05-28 01:15:12] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
[2024-05-28 01:15:12] [INFO ] Invariant cache hit.
[2024-05-28 01:15:13] [INFO ] Implicit Places using invariants in 431 ms returned [444, 445, 446, 447, 448, 449]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 442 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/688 places, 2484/2664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 496 transition count 2478
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 496 transition count 2478
Applied a total of 12 rules in 173 ms. Remains 496 /502 variables (removed 6) and now considering 2478/2484 (removed 6) transitions.
[2024-05-28 01:15:13] [INFO ] Flow matrix only has 2442 transitions (discarded 36 similar events)
// Phase 1: matrix 2442 rows 496 cols
[2024-05-28 01:15:13] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 01:15:14] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-28 01:15:14] [INFO ] Flow matrix only has 2442 transitions (discarded 36 similar events)
[2024-05-28 01:15:14] [INFO ] Invariant cache hit.
[2024-05-28 01:15:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 01:15:25] [INFO ] Implicit Places using invariants and state equation in 11068 ms returned []
Implicit Place search using SMT with State Equation took 11633 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/688 places, 2478/2664 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81432 ms. Remains : 496/688 places, 2478/2664 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLFireability-15
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLFireability-15 finished in 81621 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(F(p0)))'
[2024-05-28 01:15:25] [INFO ] Flatten gal took : 153 ms
[2024-05-28 01:15:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-28 01:15:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 688 places, 2664 transitions and 15834 arcs took 27 ms.
Total runtime 1025685 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 688
TRANSITIONS: 2664
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.090s, Sys 0.016s]


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


----------------------------------------------------------------------
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: 1260
MODEL NAME: /home/mcc/execution/420/model
688 places, 2664 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-COL-S06J06T06"
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-COL-S06J06T06, 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-171654445400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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