About the Execution of LTSMin+red for PolyORBLF-COL-S04J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16128.628 | 489358.00 | 638452.00 | 197.30 | T?TF?TFF????T?T? | normal |
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.r516-tajo-171654446400139.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 ltsminxred
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 r516-tajo-171654446400139
=====================================================================
--------------------
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 1717250099647
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:55:01] [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-06-01 13:55:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:55:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 728 ms
[2024-06-01 13:55:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:55:01] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2024-06-01 13:55:01] [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 40000 steps (15 resets) in 1642 ms. (24 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40002 steps (9 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (9 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
[2024-06-01 13:55:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:55:02] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 13:55:02] [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 298 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 58 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 392ms 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-06-01 13:55:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 13:55:03] [INFO ] Flatten gal took : 26 ms
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:55:03] [INFO ] Flatten gal took : 7 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-06-01 13:55:03] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 111 ms.
[2024-06-01 13:55:03] [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 114 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 13:55:03] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-06-01 13:55:03] [INFO ] Computed 54 invariants in 104 ms
[2024-06-01 13:55:03] [INFO ] State equation strengthened by 200 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/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 32357ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 32398ms
[2024-06-01 13:55:36] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 13:55:36] [INFO ] Invariant cache hit.
[2024-06-01 13:55:36] [INFO ] Implicit Places using invariants in 710 ms returned [668, 669, 670, 671, 672, 673, 674, 675, 676, 677]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 720 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 31 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 33307 ms. Remains : 846/870 places, 2314/2324 transitions.
Support contains 248 out of 846 places after structural reductions.
[2024-06-01 13:55:37] [INFO ] Flatten gal took : 263 ms
[2024-06-01 13:55:37] [INFO ] Flatten gal took : 198 ms
[2024-06-01 13:55:37] [INFO ] Input system was already deterministic with 2314 transitions.
RANDOM walk for 40000 steps (9 resets) in 1069 ms. (37 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 389 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
[2024-06-01 13:55:38] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 846 cols
[2024-06-01 13:55:38] [INFO ] Computed 44 invariants in 41 ms
[2024-06-01 13:55:38] [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-06-01 13:55:39] [INFO ] Deduced a trap composed of 75 places in 380 ms of which 39 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 76 places in 278 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 2405 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 250 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 2744ms 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 1 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 1 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 196 ms. Remains 566 /846 variables (removed 280) and now considering 2034/2314 (removed 280) transitions.
Running 2030 sub problems to find dead transitions.
[2024-06-01 13:55:41] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2024-06-01 13:55:41] [INFO ] Computed 44 invariants in 37 ms
[2024-06-01 13:55:41] [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-06-01 13:56:10] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:56:10] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:56:10] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:56:12] [INFO ] Deduced a trap composed of 241 places in 441 ms of which 4 ms to minimize.
[2024-06-01 13:56:13] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.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 1.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 (/ 1.0 3.0))
(s68 (/ 2.0 3.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 timeout
0.0)
(s88 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/2560 variables, and 51 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20061 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: 11/11 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, 11/51 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-06-01 13:56:23] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/2560 variables, and 52 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20036 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: 12/12 constraints]
After SMT, in 52712ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 52733ms
[2024-06-01 13:56:34] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:56:34] [INFO ] Invariant cache hit.
[2024-06-01 13:56:35] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-06-01 13:56:35] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:56:35] [INFO ] Invariant cache hit.
[2024-06-01 13:56:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:56:46] [INFO ] Implicit Places using invariants and state equation in 11706 ms returned []
Implicit Place search using SMT with State Equation took 12396 ms to find 0 implicit places.
[2024-06-01 13:56:46] [INFO ] Redundant transitions in 110 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-06-01 13:56:47] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:56:47] [INFO ] Invariant cache hit.
[2024-06-01 13:56:47] [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-06-01 13:57:17] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 247 places in 498 ms of which 4 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 251 places in 475 ms of which 4 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 232 places in 434 ms of which 3 ms to minimize.
[2024-06-01 13:57:20] [INFO ] Deduced a trap composed of 241 places in 349 ms of which 3 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 47 places in 33 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 30034 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-06-01 13:57:33] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 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 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: 0/2030 constraints, Known Traps: 16/16 constraints]
After SMT, in 74407ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 74451ms
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 139917 ms. Remains : 566/846 places, 2034/2314 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLCardinality-01
Product exploration explored 100000 steps with 13441 reset in 801 ms.
Product exploration explored 100000 steps with 13574 reset in 698 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 152 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 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 174 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)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:58:03] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:58:03] [INFO ] Invariant cache hit.
[2024-06-01 13:58:04] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 13:58:04] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 104 ms returned sat
[2024-06-01 13:58:05] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2024-06-01 13:58:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:58:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 13:58:06] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 47 ms returned sat
[2024-06-01 13:58:09] [INFO ] [Nat]Absence check using state equation in 2623 ms returned sat
[2024-06-01 13:58:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:58:09] [INFO ] [Nat]Added 200 Read/Feed constraints in 499 ms returned sat
[2024-06-01 13:58:10] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 4 ms to minimize.
[2024-06-01 13:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1215 ms
[2024-06-01 13:58:11] [INFO ] Computed and/alt/rep : 960/2776/930 causal constraints (skipped 1060 transitions) in 270 ms.
[2024-06-01 13:58:13] [INFO ] Added : 5 causal constraints over 1 iterations in 2039 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 69 ms. Remains 566 /566 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
Running 2030 sub problems to find dead transitions.
[2024-06-01 13:58:13] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:58:13] [INFO ] Invariant cache hit.
[2024-06-01 13:58:13] [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-06-01 13:58:43] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 609 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 247 places in 368 ms of which 4 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 251 places in 361 ms of which 3 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 3 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 241 places in 340 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 Real declared 562/2560 variables, and 53 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20041 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-06-01 13:58:50] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2024-06-01 13:58:50] [INFO ] Deduced a trap composed of 23 places in 163 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 20027 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 53994ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 54026ms
[2024-06-01 13:59:07] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:59:07] [INFO ] Invariant cache hit.
[2024-06-01 13:59:07] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-06-01 13:59:08] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:59:08] [INFO ] Invariant cache hit.
[2024-06-01 13:59:08] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:59:18] [INFO ] Implicit Places using invariants and state equation in 10445 ms returned []
Implicit Place search using SMT with State Equation took 11118 ms to find 0 implicit places.
[2024-06-01 13:59:18] [INFO ] Redundant transitions in 130 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-06-01 13:59:18] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 13:59:18] [INFO ] Invariant cache hit.
[2024-06-01 13:59:18] [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-06-01 13:59:47] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 3 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:59:49] [INFO ] Deduced a trap composed of 247 places in 422 ms of which 3 ms to minimize.
[2024-06-01 13:59:49] [INFO ] Deduced a trap composed of 251 places in 451 ms of which 5 ms to minimize.
[2024-06-01 13:59:50] [INFO ] Deduced a trap composed of 232 places in 400 ms of which 3 ms to minimize.
[2024-06-01 13:59:50] [INFO ] Deduced a trap composed of 241 places in 360 ms of which 3 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 47 places in 63 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 30034 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-06-01 14:00:04] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 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 30032 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 73828ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 73853ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 139216 ms. Remains : 566/566 places, 2034/2034 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 139 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 6 ms. (2 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 163 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:00:33] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:00:33] [INFO ] Invariant cache hit.
[2024-06-01 14:00:33] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 14:00:33] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 122 ms returned sat
[2024-06-01 14:00:35] [INFO ] [Real]Absence check using state equation in 1520 ms returned sat
[2024-06-01 14:00:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:00:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 14:00:36] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 42 ms returned sat
[2024-06-01 14:00:39] [INFO ] [Nat]Absence check using state equation in 2602 ms returned sat
[2024-06-01 14:00:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:00:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 491 ms returned sat
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 3 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1186 ms
[2024-06-01 14:00:41] [INFO ] Computed and/alt/rep : 960/2776/930 causal constraints (skipped 1060 transitions) in 251 ms.
[2024-06-01 14:00:42] [INFO ] Added : 5 causal constraints over 1 iterations in 1952 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13611 reset in 781 ms.
Product exploration explored 100000 steps with 13392 reset in 649 ms.
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 37 ms. Remains 566 /566 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
Running 2030 sub problems to find dead transitions.
[2024-06-01 14:00:44] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:00:44] [INFO ] Invariant cache hit.
[2024-06-01 14:00:44] [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-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 247 places in 481 ms of which 3 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 251 places in 431 ms of which 4 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 232 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 241 places in 410 ms of which 4 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 47 places in 45 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 20043 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-06-01 14:01:20] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 9)
(s173 0)
(s174 1)
(s175 1)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 6)
(s424timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20027 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 53309ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 53331ms
[2024-06-01 14:01:37] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:01:37] [INFO ] Invariant cache hit.
[2024-06-01 14:01:38] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-06-01 14:01:38] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:01:38] [INFO ] Invariant cache hit.
[2024-06-01 14:01:38] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:01:47] [INFO ] Implicit Places using invariants and state equation in 9826 ms returned []
Implicit Place search using SMT with State Equation took 10276 ms to find 0 implicit places.
[2024-06-01 14:01:47] [INFO ] Redundant transitions in 51 ms returned []
Running 2030 sub problems to find dead transitions.
[2024-06-01 14:01:48] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-06-01 14:01:48] [INFO ] Invariant cache hit.
[2024-06-01 14:01:48] [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-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:02:17] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:02:17] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:02:17] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:02:17] [INFO ] Deduced a trap composed of 247 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:02:18] [INFO ] Deduced a trap composed of 251 places in 325 ms of which 2 ms to minimize.
[2024-06-01 14:02:18] [INFO ] Deduced a trap composed of 232 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:02:18] [INFO ] Deduced a trap composed of 241 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 47 places in 42 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 30028 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-06-01 14:02:32] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-06-01 14:02:53] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 4 ms to minimize.
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 206 places in 280 ms of which 2 ms to minimize.
SMT process timed out in 72460ms, After SMT, problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 72488ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 136203 ms. Remains : 566/566 places, 2034/2034 transitions.
Treatment of property PolyORBLF-COL-S04J04T10-LTLCardinality-01 finished in 439203 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) U G(p1))))'
Support contains 40 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 2314/2314 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 836 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 836 transition count 2304
Applied a total of 20 rules in 42 ms. Remains 836 /846 variables (removed 10) and now considering 2304/2314 (removed 10) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:03:00] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 14:03:00] [INFO ] Computed 44 invariants in 32 ms
[2024-06-01 14:03:00] [INFO ] State equation strengthened by 200 read => feed constraints.
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-00
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-01
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-02
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-03
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-04
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-05
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-06
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-07
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-08
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-09
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-10
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-11
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-12
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-13
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-14
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-LTLCardinality-15
BK_STOP 1717250589005
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-00
ltl formula formula --ltl=/tmp/1059/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-01
ltl formula formula --ltl=/tmp/1059/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-02
ltl formula formula --ltl=/tmp/1059/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-03
ltl formula formula --ltl=/tmp/1059/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-04
ltl formula formula --ltl=/tmp/1059/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-05
ltl formula formula --ltl=/tmp/1059/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-06
ltl formula formula --ltl=/tmp/1059/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-07
ltl formula formula --ltl=/tmp/1059/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-08
ltl formula formula --ltl=/tmp/1059/ltl_8_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-09
ltl formula formula --ltl=/tmp/1059/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-10
ltl formula formula --ltl=/tmp/1059/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-11
ltl formula formula --ltl=/tmp/1059/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-12
ltl formula formula --ltl=/tmp/1059/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-13
ltl formula formula --ltl=/tmp/1059/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-14
ltl formula formula --ltl=/tmp/1059/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J04T10-LTLCardinality-15
ltl formula formula --ltl=/tmp/1059/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
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="ltsminxred"
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 ltsminxred"
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 r516-tajo-171654446400139"
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 '
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 ;