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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 10K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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-S04J04T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716851644906

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 23:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:14:06] [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-27 23:14:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:14:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 802 ms
[2024-05-27 23:14:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 23:14:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 23:14:07] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-14 TRUE 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
RANDOM walk for 40002 steps (11 resets) in 1097 ms. (36 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40001 steps (8 resets) in 387 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 374 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
[2024-05-27 23:14:08] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:14:08] [INFO ] Computed 26 invariants in 6 ms
[2024-05-27 23:14:08] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/53 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/54 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 7 (OVERLAPS) 21/75 variables, 13/22 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/77 variables, 1/23 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/79 variables, 2/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 5 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/25 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/48 variables, 3/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/51 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Int declared 75/145 variables, and 22 constraints, problems are : Problem set: 6 solved, 0 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:14:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-27 23:14:09] [INFO ] Flatten gal took : 40 ms
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:14:09] [INFO ] Flatten gal took : 24 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 23:14:09] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 137 ms.
[2024-05-27 23:14:09] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 248 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Applied a total of 24 rules in 124 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-05-27 23:14:09] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-05-27 23:14:09] [INFO ] Computed 54 invariants in 110 ms
[2024-05-27 23:14:09] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 34051ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 34093ms
[2024-05-27 23:14:43] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-05-27 23:14:43] [INFO ] Invariant cache hit.
[2024-05-27 23:14:44] [INFO ] Implicit Places using invariants in 745 ms returned [668, 669, 670, 671, 672, 673, 674, 675, 676, 677]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 761 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 846/870 places, 2314/2324 transitions.
Applied a total of 0 rules in 39 ms. Remains 846 /846 variables (removed 0) and now considering 2314/2314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35043 ms. Remains : 846/870 places, 2314/2324 transitions.
Support contains 248 out of 846 places after structural reductions.
[2024-05-27 23:14:44] [INFO ] Flatten gal took : 270 ms
[2024-05-27 23:14:44] [INFO ] Flatten gal took : 185 ms
[2024-05-27 23:14:45] [INFO ] Input system was already deterministic with 2314 transitions.
RANDOM walk for 40000 steps (9 resets) in 566 ms. (70 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
[2024-05-27 23:14:45] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 846 cols
[2024-05-27 23:14:45] [INFO ] Computed 44 invariants in 85 ms
[2024-05-27 23:14:45] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 240/284 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 94/378 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/390 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 7 (OVERLAPS) 448/838 variables, 28/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-27 23:14:46] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 39 ms to minimize.
[2024-05-27 23:14:46] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 4/842 variables, 4/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/844 variables, 2/45 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/844 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3118/3120 variables, and 889 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2894 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 844/846 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 239/261 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/355 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/367 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Int declared 836/3120 variables, and 35 constraints, problems are : Problem set: 4 solved, 0 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/846 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/2 constraints]
After SMT, in 3383ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 8 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' '!(G(F(p0)))'
Support contains 1 out of 846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 846/846 places, 2314/2314 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 846 transition count 2244
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 776 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 776 transition count 2144
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 676 transition count 2144
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 11 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 540 place count 576 transition count 2044
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 550 place count 566 transition count 2034
Iterating global reduction 2 with 10 rules applied. Total rules applied 560 place count 566 transition count 2034
Applied a total of 560 rules in 364 ms. Remains 566 /846 variables (removed 280) and now considering 2034/2314 (removed 280) transitions.
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:14:49] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2024-05-27 23:14:49] [INFO ] Computed 44 invariants in 39 ms
[2024-05-27 23:14:49] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:15:22] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 14 ms to minimize.
[2024-05-27 23:15:22] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-27 23:15:22] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2024-05-27 23:15:22] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2024-05-27 23:15:22] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 47 places in 707 ms of which 2 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:15:23] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:15:24] [INFO ] Deduced a trap composed of 241 places in 417 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/2560 variables, and 50 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:15:26] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-27 23:15:33] [INFO ] Deduced a trap composed of 300 places in 365 ms of which 4 ms to minimize.
[2024-05-27 23:15:35] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 53 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 13/13 constraints]
After SMT, in 54359ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 54380ms
[2024-05-27 23:15:44] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:15:44] [INFO ] Invariant cache hit.
[2024-05-27 23:15:44] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-27 23:15:44] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:15:44] [INFO ] Invariant cache hit.
[2024-05-27 23:15:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:15:56] [INFO ] Implicit Places using invariants and state equation in 11599 ms returned []
Implicit Place search using SMT with State Equation took 12264 ms to find 0 implicit places.
[2024-05-27 23:15:56] [INFO ] Redundant transitions in 110 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:15:56] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:15:56] [INFO ] Invariant cache hit.
[2024-05-27 23:15:56] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:16:28] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:16:29] [INFO ] Deduced a trap composed of 247 places in 485 ms of which 4 ms to minimize.
[2024-05-27 23:16:30] [INFO ] Deduced a trap composed of 251 places in 432 ms of which 4 ms to minimize.
[2024-05-27 23:16:30] [INFO ] Deduced a trap composed of 232 places in 412 ms of which 3 ms to minimize.
[2024-05-27 23:16:31] [INFO ] Deduced a trap composed of 241 places in 421 ms of which 3 ms to minimize.
[2024-05-27 23:16:32] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/2560 variables, and 54 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:16:43] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-27 23:17:06] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 56 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 16/16 constraints]
After SMT, in 74698ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 74725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 566/846 places, 2034/2314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141863 ms. Remains : 566/846 places, 2034/2314 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLCardinality-01
Product exploration explored 100000 steps with 13390 reset in 833 ms.
Product exploration explored 100000 steps with 13387 reset in 732 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 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 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 105 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:17:13] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:17:13] [INFO ] Invariant cache hit.
[2024-05-27 23:17:14] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2024-05-27 23:17:14] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 112 ms returned sat
[2024-05-27 23:17:15] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2024-05-27 23:17:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:17:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-27 23:17:16] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 47 ms returned sat
[2024-05-27 23:17:19] [INFO ] [Nat]Absence check using state equation in 2529 ms returned sat
[2024-05-27 23:17:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:17:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 404 ms returned sat
[2024-05-27 23:17:20] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 3 ms to minimize.
[2024-05-27 23:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1170 ms
[2024-05-27 23:17:20] [INFO ] Computed and/alt/rep : 960/2776/930 causal constraints (skipped 1060 transitions) in 166 ms.
[2024-05-27 23:17:22] [INFO ] Added : 5 causal constraints over 1 iterations in 2008 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 2034/2034 transitions.
Applied a total of 0 rules in 45 ms. Remains 566 /566 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:17:22] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:17:22] [INFO ] Invariant cache hit.
[2024-05-27 23:17:22] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:17:54] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-27 23:17:54] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-27 23:17:54] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 4 ms to minimize.
[2024-05-27 23:17:54] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-05-27 23:17:55] [INFO ] Deduced a trap composed of 247 places in 382 ms of which 4 ms to minimize.
[2024-05-27 23:17:56] [INFO ] Deduced a trap composed of 251 places in 399 ms of which 4 ms to minimize.
[2024-05-27 23:17:56] [INFO ] Deduced a trap composed of 232 places in 371 ms of which 4 ms to minimize.
[2024-05-27 23:17:57] [INFO ] Deduced a trap composed of 241 places in 416 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/2560 variables, and 53 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-27 23:18:01] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-27 23:18:01] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 55 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/566 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 15/15 constraints]
After SMT, in 54976ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 55008ms
[2024-05-27 23:18:17] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:18:17] [INFO ] Invariant cache hit.
[2024-05-27 23:18:18] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-27 23:18:18] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:18:18] [INFO ] Invariant cache hit.
[2024-05-27 23:18:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:18:29] [INFO ] Implicit Places using invariants and state equation in 10992 ms returned []
Implicit Place search using SMT with State Equation took 11596 ms to find 0 implicit places.
[2024-05-27 23:18:29] [INFO ] Redundant transitions in 113 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-05-27 23:18:29] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-27 23:18:29] [INFO ] Invariant cache hit.
[2024-05-27 23:18:29] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.372

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 870
TRANSITIONS: 5034
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 34774
UNFOLDING TIME: 0.767

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.184
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.596
OK.
----------------------------------------------------------------------
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: 875
MODEL NAME: /home/mcc/execution/model
870 places, 5034 transitions.

No place bound informations found.
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..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-S04J04T10"
export BK_EXAMINATION="LTLCardinality"
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-S04J04T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445300139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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