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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 17:09 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.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716855850062

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-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:24:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:24:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 00:24:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:24:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1226 ms
[2024-05-28 00:24:13] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:24:13] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 00:24:13] [INFO ] Skeletonized 16 HLPN properties in 14 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40006 steps (3899 resets) in 2484 ms. (16 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 78 ms. (50 steps per ms) remains 11/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 16 ms. (235 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (20 resets) in 62 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (10 resets) in 59 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (26 resets) in 33 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (18 resets) in 53 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (18 resets) in 42 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4005 steps (14 resets) in 68 ms. (58 steps per ms) remains 9/9 properties
[2024-05-28 00:24:14] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:24:15] [INFO ] Computed 26 invariants in 40 ms
[2024-05-28 00:24:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 00:24:15] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 9 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 36/46 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/51 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 22 constraints, problems are : Problem set: 9 solved, 0 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 483ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:24:15] [INFO ] Flatten gal took : 56 ms
[2024-05-28 00:24:15] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-05-28 00:24:16] [INFO ] Unfolded HLPN to a Petri net with 810 places and 14014 transitions 118428 arcs in 532 ms.
[2024-05-28 00:24:16] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Support contains 347 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 804 transition count 3254
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 796 transition count 3246
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 796 transition count 3246
Applied a total of 22 rules in 319 ms. Remains 796 /810 variables (removed 14) and now considering 3246/3254 (removed 8) transitions.
Running 3240 sub problems to find dead transitions.
[2024-05-28 00:24:17] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 796 cols
[2024-05-28 00:24:17] [INFO ] Computed 52 invariants in 194 ms
[2024-05-28 00:24:17] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 50397ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 50542ms
[2024-05-28 00:25:07] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
[2024-05-28 00:25:07] [INFO ] Invariant cache hit.
[2024-05-28 00:25:08] [INFO ] Implicit Places using invariants in 789 ms returned [626, 627, 628, 629, 630, 631, 632, 633]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 804 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 788/810 places, 3246/3254 transitions.
Applied a total of 0 rules in 38 ms. Remains 788 /788 variables (removed 0) and now considering 3246/3246 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51786 ms. Remains : 788/810 places, 3246/3254 transitions.
Support contains 347 out of 788 places after structural reductions.
[2024-05-28 00:25:08] [INFO ] Flatten gal took : 601 ms
[2024-05-28 00:25:09] [INFO ] Flatten gal took : 396 ms
[2024-05-28 00:25:10] [INFO ] Input system was already deterministic with 3246 transitions.
Support contains 338 out of 788 places (down from 347) after GAL structural reductions.
RANDOM walk for 40000 steps (258 resets) in 1241 ms. (32 steps per ms) remains 4/23 properties
BEST_FIRST walk for 40003 steps (101 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (110 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (103 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (103 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
[2024-05-28 00:25:11] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 788 cols
[2024-05-28 00:25:11] [INFO ] Computed 44 invariants in 108 ms
[2024-05-28 00:25:11] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:25:11] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 4 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 160/226 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/238 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 531/769 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 8 (OVERLAPS) 5/774 variables, 5/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 786/3986 variables, and 44 constraints, problems are : Problem set: 4 solved, 0 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/788 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 698ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 788 transition count 3206
Reduce places removed 40 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 56 rules applied. Total rules applied 96 place count 748 transition count 3190
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 112 place count 732 transition count 3190
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 112 place count 732 transition count 3102
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 288 place count 644 transition count 3102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 480 place count 548 transition count 3006
Applied a total of 480 rules in 329 ms. Remains 548 /788 variables (removed 240) and now considering 3006/3246 (removed 240) transitions.
Running 3000 sub problems to find dead transitions.
[2024-05-28 00:25:12] [INFO ] Flow matrix only has 2958 transitions (discarded 48 similar events)
// Phase 1: matrix 2958 rows 548 cols
[2024-05-28 00:25:12] [INFO ] Computed 44 invariants in 91 ms
[2024-05-28 00:25:12] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
SMT process timed out in 54402ms, After SMT, problems are : Problem set: 0 solved, 3000 unsolved
Search for dead transitions found 0 dead transitions in 54448ms
[2024-05-28 00:26:07] [INFO ] Flow matrix only has 2958 transitions (discarded 48 similar events)
[2024-05-28 00:26:07] [INFO ] Invariant cache hit.
[2024-05-28 00:26:07] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-28 00:26:07] [INFO ] Flow matrix only has 2958 transitions (discarded 48 similar events)
[2024-05-28 00:26:07] [INFO ] Invariant cache hit.
[2024-05-28 00:26:08] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:26:22] [INFO ] Implicit Places using invariants and state equation in 14727 ms returned []
Implicit Place search using SMT with State Equation took 15509 ms to find 0 implicit places.
[2024-05-28 00:26:22] [INFO ] Redundant transitions in 184 ms returned []
Running 3000 sub problems to find dead transitions.
[2024-05-28 00:26:22] [INFO ] Flow matrix only has 2958 transitions (discarded 48 similar events)
[2024-05-28 00:26:22] [INFO ] Invariant cache hit.
[2024-05-28 00:26:22] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
[2024-05-28 00:27:17] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-05-28 00:27:17] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2024-05-28 00:27:17] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-05-28 00:27:17] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 1 ms to minimize.
[2024-05-28 00:27:17] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:27:18] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:27:18] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:27:19] [INFO ] Deduced a trap composed of 253 places in 771 ms of which 8 ms to minimize.
[2024-05-28 00:27:19] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:27:20] [INFO ] Deduced a trap composed of 237 places in 762 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/3506 variables, and 48 constraints, problems are : Problem set: 0 solved, 3000 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/548 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3000/1320 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
[2024-05-28 00:27:25] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/3506 variables, and 49 constraints, problems are : Problem set: 0 solved, 3000 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/548 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1320 constraints, Known Traps: 11/11 constraints]
After SMT, in 89846ms problems are : Problem set: 0 solved, 3000 unsolved
Search for dead transitions found 0 dead transitions in 89889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 548/788 places, 3006/3246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160404 ms. Remains : 548/788 places, 3006/3246 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-00
Stuttering criterion allowed to conclude after 526 steps with 3 reset in 16 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-00 finished in 160701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1&&X(G(p0))) U p2))))'
Support contains 65 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 3238
Applied a total of 16 rules in 131 ms. Remains 780 /788 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:27:53] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 00:27:53] [INFO ] Computed 44 invariants in 120 ms
[2024-05-28 00:27:53] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 51646ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 51754ms
[2024-05-28 00:28:44] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:28:44] [INFO ] Invariant cache hit.
[2024-05-28 00:28:46] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-05-28 00:28:46] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:28:46] [INFO ] Invariant cache hit.
[2024-05-28 00:28:47] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:29:12] [INFO ] Implicit Places using invariants and state equation in 26044 ms returned []
Implicit Place search using SMT with State Equation took 27348 ms to find 0 implicit places.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:29:12] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:29:12] [INFO ] Invariant cache hit.
[2024-05-28 00:29:12] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 66257ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 66350ms
Starting structural reductions in LTL mode, iteration 1 : 780/788 places, 3238/3246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145620 ms. Remains : 780/788 places, 3238/3246 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-03 finished in 145943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (p1 U (X(p0) U X(p2)))))'
Support contains 90 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 3238
Applied a total of 16 rules in 77 ms. Remains 780 /788 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:30:19] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:30:19] [INFO ] Invariant cache hit.
[2024-05-28 00:30:19] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 52300ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 52365ms
[2024-05-28 00:31:11] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:31:11] [INFO ] Invariant cache hit.
[2024-05-28 00:31:12] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-28 00:31:12] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:31:12] [INFO ] Invariant cache hit.
[2024-05-28 00:31:13] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:31:34] [INFO ] Implicit Places using invariants and state equation in 22778 ms returned []
Implicit Place search using SMT with State Equation took 23490 ms to find 0 implicit places.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:31:34] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:31:34] [INFO ] Invariant cache hit.
[2024-05-28 00:31:34] [INFO ] State equation strengthened by 224 read => feed constraints.
(s169 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 10.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 60577ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Starting structural reductions in LTL mode, iteration 1 : 780/788 places, 3238/3246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136558 ms. Remains : 780/788 places, 3238/3246 transitions.
Stuttering acceptance computed with spot in 234 ms :[p2, p2, p2, (AND p0 p2), true]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 83 steps with 2 reset in 3 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-04 finished in 136835 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(X((G(F(p0)) U G((p1&&F(p2)))))))'
Support contains 53 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Applied a total of 0 rules in 24 ms. Remains 788 /788 variables (removed 0) and now considering 3246/3246 (removed 0) transitions.
Running 3240 sub problems to find dead transitions.
[2024-05-28 00:32:35] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 788 cols
[2024-05-28 00:32:35] [INFO ] Computed 44 invariants in 160 ms
[2024-05-28 00:32:35] [INFO ] State equation strengthened by 224 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/782 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 52051ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 52084ms
[2024-05-28 00:33:27] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
[2024-05-28 00:33:27] [INFO ] Invariant cache hit.
[2024-05-28 00:33:28] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-28 00:33:28] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
[2024-05-28 00:33:28] [INFO ] Invariant cache hit.
[2024-05-28 00:33:29] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:33:50] [INFO ] Implicit Places using invariants and state equation in 21923 ms returned []
Implicit Place search using SMT with State Equation took 22572 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-28 00:33:50] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
[2024-05-28 00:33:50] [INFO ] Invariant cache hit.
[2024-05-28 00:33:50] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 62354ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 62390ms
Finished structural reductions in LTL mode , in 1 iterations and 137092 ms. Remains : 788/788 places, 3246/3246 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-06
Stuttering criterion allowed to conclude after 1938 steps with 21 reset in 16 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-06 finished in 137423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 3214
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 756 transition count 3206
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 748 transition count 3206
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 80 place count 748 transition count 3102
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 288 place count 644 transition count 3102
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 448 place count 564 transition count 3022
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 456 place count 556 transition count 3014
Iterating global reduction 3 with 8 rules applied. Total rules applied 464 place count 556 transition count 3014
Applied a total of 464 rules in 207 ms. Remains 556 /788 variables (removed 232) and now considering 3014/3246 (removed 232) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:34:53] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
// Phase 1: matrix 2966 rows 556 cols
[2024-05-28 00:34:53] [INFO ] Computed 44 invariants in 99 ms
[2024-05-28 00:34:53] [INFO ] State equation strengthened by 224 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/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 49823ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 49853ms
[2024-05-28 00:35:43] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:35:43] [INFO ] Invariant cache hit.
[2024-05-28 00:35:43] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-28 00:35:43] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:35:43] [INFO ] Invariant cache hit.
[2024-05-28 00:35:45] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:35:59] [INFO ] Implicit Places using invariants and state equation in 15394 ms returned []
Implicit Place search using SMT with State Equation took 16191 ms to find 0 implicit places.
[2024-05-28 00:35:59] [INFO ] Redundant transitions in 150 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:35:59] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:35:59] [INFO ] Invariant cache hit.
[2024-05-28 00:35:59] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/3522 variables, and 46 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3008/1328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3008 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:37:17] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(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 9)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(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 1)
(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 1)
(s239 0)
(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 1)
(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 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(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 1)
(s318 0)
(s319 1)
(s320 1)
(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 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(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 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(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 7)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 3)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 3)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)timeout

(s520 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/3522 variables, and 47 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1328 constraints, Known Traps: 9/9 constraints]
After SMT, in 97239ms problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 97281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/788 places, 3014/3246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163714 ms. Remains : 556/788 places, 3014/3246 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-07
Product exploration explored 100000 steps with 13229 reset in 1383 ms.
Product exploration explored 100000 steps with 13153 reset in 1408 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 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 75 ms :[(NOT p0), (NOT p0)]
[2024-05-28 00:37:40] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:37:40] [INFO ] Invariant cache hit.
[2024-05-28 00:37:41] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-28 00:37:41] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 81 ms returned sat
[2024-05-28 00:37:43] [INFO ] [Real]Absence check using state equation in 2072 ms returned sat
[2024-05-28 00:37:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:37:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-28 00:37:44] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 58 ms returned sat
[2024-05-28 00:37:47] [INFO ] [Nat]Absence check using state equation in 2877 ms returned sat
[2024-05-28 00:37:47] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:37:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 00:37:50] [INFO ] [Nat]Added 224 Read/Feed constraints in 3035 ms returned unknown
Could not prove EG (NOT p0)
Support contains 9 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 3014/3014 transitions.
Applied a total of 0 rules in 62 ms. Remains 556 /556 variables (removed 0) and now considering 3014/3014 (removed 0) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:37:51] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:37:51] [INFO ] Invariant cache hit.
[2024-05-28 00:37:51] [INFO ] State equation strengthened by 224 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/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 51856ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 51897ms
[2024-05-28 00:38:42] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:38:42] [INFO ] Invariant cache hit.
[2024-05-28 00:38:43] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-05-28 00:38:43] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:38:43] [INFO ] Invariant cache hit.
[2024-05-28 00:38:44] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:38:58] [INFO ] Implicit Places using invariants and state equation in 15305 ms returned []
Implicit Place search using SMT with State Equation took 16080 ms to find 0 implicit places.
[2024-05-28 00:38:59] [INFO ] Redundant transitions in 96 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:38:59] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:38:59] [INFO ] Invariant cache hit.
[2024-05-28 00:38:59] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:39:54] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-28 00:39:54] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 3 ms to minimize.
[2024-05-28 00:39:54] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:39:55] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:39:55] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:39:55] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-28 00:39:55] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 0 ms to minimize.
[2024-05-28 00:39:55] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/3522 variables, and 46 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3008/1328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3008 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:40:10] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/3522 variables, and 47 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1328 constraints, Known Traps: 9/9 constraints]
After SMT, in 90920ms problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 90965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 159128 ms. Remains : 556/556 places, 3014/3014 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-28 00:40:30] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:40:30] [INFO ] Invariant cache hit.
[2024-05-28 00:40:31] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-28 00:40:31] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 73 ms returned sat
[2024-05-28 00:40:33] [INFO ] [Real]Absence check using state equation in 2222 ms returned sat
[2024-05-28 00:40:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:40:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 38 ms returned sat
[2024-05-28 00:40:35] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 61 ms returned sat
[2024-05-28 00:40:38] [INFO ] [Nat]Absence check using state equation in 2820 ms returned sat
[2024-05-28 00:40:38] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:40:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 00:40:39] [INFO ] [Nat]Added 224 Read/Feed constraints in 1622 ms returned sat
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-05-28 00:40:41] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2024-05-28 00:40:41] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 15 ms to minimize.
[2024-05-28 00:40:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2157 ms
[2024-05-28 00:40:42] [INFO ] Computed and/alt/rep : 2006/7341/2001 causal constraints (skipped 959 transitions) in 443 ms.
[2024-05-28 00:40:47] [INFO ] Added : 93 causal constraints over 19 iterations in 5554 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13266 reset in 1396 ms.
Product exploration explored 100000 steps with 13183 reset in 1377 ms.
Support contains 9 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 3014/3014 transitions.
Applied a total of 0 rules in 82 ms. Remains 556 /556 variables (removed 0) and now considering 3014/3014 (removed 0) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:40:50] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:40:50] [INFO ] Invariant cache hit.
[2024-05-28 00:40:50] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 48118ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 48159ms
[2024-05-28 00:41:38] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:41:38] [INFO ] Invariant cache hit.
[2024-05-28 00:41:39] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-28 00:41:39] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:41:39] [INFO ] Invariant cache hit.
[2024-05-28 00:41:40] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:41:54] [INFO ] Implicit Places using invariants and state equation in 15108 ms returned []
Implicit Place search using SMT with State Equation took 16043 ms to find 0 implicit places.
[2024-05-28 00:41:54] [INFO ] Redundant transitions in 85 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:41:54] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:41:54] [INFO ] Invariant cache hit.
[2024-05-28 00:41:54] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:42:52] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 3 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 0 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 0 ms to minimize.
[2024-05-28 00:42:53] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/3522 variables, and 46 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3008/1328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3008 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:43:09] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/3522 variables, and 47 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1328 constraints, Known Traps: 9/9 constraints]
After SMT, in 93709ms problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 93760ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 158160 ms. Remains : 556/556 places, 3014/3014 transitions.
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-07 finished in 516043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p0||G(p1)))))))'
Support contains 97 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 3238
Applied a total of 16 rules in 54 ms. Remains 780 /788 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:43:29] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 00:43:29] [INFO ] Computed 44 invariants in 141 ms
[2024-05-28 00:43:29] [INFO ] State equation strengthened by 224 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/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 48909ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 48957ms
[2024-05-28 00:44:18] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:44:18] [INFO ] Invariant cache hit.
[2024-05-28 00:44:18] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 00:44:18] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:44:18] [INFO ] Invariant cache hit.
[2024-05-28 00:44:20] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:44:50] [INFO ] Performed 484/780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 00:44:54] [INFO ] Implicit Places using invariants and state equation in 35472 ms returned []
Implicit Place search using SMT with State Equation took 36151 ms to find 0 implicit places.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:44:54] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:44:54] [INFO ] Invariant cache hit.
[2024-05-28 00:44:54] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 65529ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 65560ms
Starting structural reductions in LTL mode, iteration 1 : 780/788 places, 3238/3246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150742 ms. Remains : 780/788 places, 3238/3246 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-08 finished in 150906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 3190
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 732 transition count 3190
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 112 place count 732 transition count 3094
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 304 place count 636 transition count 3094
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 512 place count 532 transition count 2990
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 520 place count 524 transition count 2982
Iterating global reduction 2 with 8 rules applied. Total rules applied 528 place count 524 transition count 2982
Applied a total of 528 rules in 162 ms. Remains 524 /788 variables (removed 264) and now considering 2982/3246 (removed 264) transitions.
Running 2976 sub problems to find dead transitions.
[2024-05-28 00:46:00] [INFO ] Flow matrix only has 2934 transitions (discarded 48 similar events)
// Phase 1: matrix 2934 rows 524 cols
[2024-05-28 00:46:00] [INFO ] Computed 44 invariants in 50 ms
[2024-05-28 00:46:00] [INFO ] State equation strengthened by 224 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/518 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2976 unsolved
SMT process timed out in 53425ms, After SMT, problems are : Problem set: 0 solved, 2976 unsolved
Search for dead transitions found 0 dead transitions in 53453ms
[2024-05-28 00:46:53] [INFO ] Flow matrix only has 2934 transitions (discarded 48 similar events)
[2024-05-28 00:46:53] [INFO ] Invariant cache hit.
[2024-05-28 00:46:54] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-28 00:46:54] [INFO ] Flow matrix only has 2934 transitions (discarded 48 similar events)
[2024-05-28 00:46:54] [INFO ] Invariant cache hit.
[2024-05-28 00:46:55] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:47:06] [INFO ] Implicit Places using invariants and state equation in 11970 ms returned []
Implicit Place search using SMT with State Equation took 12664 ms to find 0 implicit places.
[2024-05-28 00:47:06] [INFO ] Redundant transitions in 93 ms returned []
Running 2976 sub problems to find dead transitions.
[2024-05-28 00:47:06] [INFO ] Flow matrix only has 2934 transitions (discarded 48 similar events)
[2024-05-28 00:47:06] [INFO ] Invariant cache hit.
[2024-05-28 00:47:06] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2976 unsolved
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:47:57] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:47:58] [INFO ] Deduced a trap composed of 242 places in 576 ms of which 4 ms to minimize.
[2024-05-28 00:47:59] [INFO ] Deduced a trap composed of 304 places in 578 ms of which 3 ms to minimize.
[2024-05-28 00:47:59] [INFO ] Deduced a trap composed of 242 places in 616 ms of which 3 ms to minimize.
[2024-05-28 00:48:02] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 2 ms to minimize.
[2024-05-28 00:48:02] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:48:04] [INFO ] Deduced a trap composed of 234 places in 516 ms of which 3 ms to minimize.
SMT process timed out in 57938ms, After SMT, problems are : Problem set: 0 solved, 2976 unsolved
Search for dead transitions found 0 dead transitions in 57975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 524/788 places, 2982/3246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124379 ms. Remains : 524/788 places, 2982/3246 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-09
Stuttering criterion allowed to conclude after 234 steps with 2 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-09 finished in 124463 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)))'
Support contains 56 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 3238
Applied a total of 16 rules in 42 ms. Remains 780 /788 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:48:04] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 00:48:04] [INFO ] Computed 44 invariants in 68 ms
[2024-05-28 00:48:04] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47515ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47560ms
[2024-05-28 00:48:52] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:48:52] [INFO ] Invariant cache hit.
[2024-05-28 00:48:52] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-28 00:48:52] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:48:52] [INFO ] Invariant cache hit.
[2024-05-28 00:48:53] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:49:23] [INFO ] Performed 539/780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 00:49:28] [INFO ] Implicit Places using invariants and state equation in 35454 ms returned []
Implicit Place search using SMT with State Equation took 36132 ms to find 0 implicit places.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:49:28] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:49:28] [INFO ] Invariant cache hit.
[2024-05-28 00:49:28] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 58798ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 58861ms
Starting structural reductions in LTL mode, iteration 1 : 780/788 places, 3238/3246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142625 ms. Remains : 780/788 places, 3238/3246 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 1480 ms.
Product exploration explored 100000 steps with 50000 reset in 1378 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-11 finished in 145587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 3214
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 756 transition count 3206
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 748 transition count 3206
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 80 place count 748 transition count 3110
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 272 place count 652 transition count 3110
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 464 place count 556 transition count 3014
Applied a total of 464 rules in 240 ms. Remains 556 /788 variables (removed 232) and now considering 3014/3246 (removed 232) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:50:30] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
// Phase 1: matrix 2966 rows 556 cols
[2024-05-28 00:50:30] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 00:50:30] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 48467ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 48509ms
[2024-05-28 00:51:18] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:51:18] [INFO ] Invariant cache hit.
[2024-05-28 00:51:19] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-28 00:51:19] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:51:19] [INFO ] Invariant cache hit.
[2024-05-28 00:51:20] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:51:33] [INFO ] Implicit Places using invariants and state equation in 13662 ms returned []
Implicit Place search using SMT with State Equation took 14281 ms to find 0 implicit places.
[2024-05-28 00:51:33] [INFO ] Redundant transitions in 73 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:51:33] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:51:33] [INFO ] Invariant cache hit.
[2024-05-28 00:51:33] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 9 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 0 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 0 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 3 ms to minimize.
[2024-05-28 00:52:25] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2024-05-28 00:52:26] [INFO ] Deduced a trap composed of 266 places in 590 ms of which 5 ms to minimize.
[2024-05-28 00:52:27] [INFO ] Deduced a trap composed of 56 places in 644 ms of which 3 ms to minimize.
[2024-05-28 00:52:27] [INFO ] Deduced a trap composed of 281 places in 664 ms of which 3 ms to minimize.
[2024-05-28 00:52:28] [INFO ] Deduced a trap composed of 253 places in 642 ms of which 3 ms to minimize.
[2024-05-28 00:52:29] [INFO ] Deduced a trap composed of 266 places in 602 ms of which 3 ms to minimize.
[2024-05-28 00:52:29] [INFO ] Deduced a trap composed of 256 places in 667 ms of which 4 ms to minimize.
[2024-05-28 00:52:30] [INFO ] Deduced a trap composed of 328 places in 586 ms of which 3 ms to minimize.
[2024-05-28 00:52:31] [INFO ] Deduced a trap composed of 264 places in 598 ms of which 3 ms to minimize.
SMT process timed out in 57779ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 57813ms
Starting structural reductions in SI_LTL mode, iteration 1 : 556/788 places, 3014/3246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120946 ms. Remains : 556/788 places, 3014/3246 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-14
Product exploration explored 100000 steps with 1032 reset in 704 ms.
Product exploration explored 100000 steps with 1037 reset in 934 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 371 steps (5 resets) in 9 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 16 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 3014/3014 transitions.
Applied a total of 0 rules in 56 ms. Remains 556 /556 variables (removed 0) and now considering 3014/3014 (removed 0) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:52:33] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:52:33] [INFO ] Invariant cache hit.
[2024-05-28 00:52:33] [INFO ] State equation strengthened by 224 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/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 47170ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 47203ms
[2024-05-28 00:53:20] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:53:20] [INFO ] Invariant cache hit.
[2024-05-28 00:53:20] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-28 00:53:20] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:53:20] [INFO ] Invariant cache hit.
[2024-05-28 00:53:22] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:53:34] [INFO ] Implicit Places using invariants and state equation in 13494 ms returned []
Implicit Place search using SMT with State Equation took 14092 ms to find 0 implicit places.
[2024-05-28 00:53:34] [INFO ] Redundant transitions in 127 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:53:34] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:53:34] [INFO ] Invariant cache hit.
[2024-05-28 00:53:34] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:54:24] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:54:24] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:54:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 0 ms to minimize.
[2024-05-28 00:54:25] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:54:25] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:54:25] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2024-05-28 00:54:25] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:54:26] [INFO ] Deduced a trap composed of 266 places in 599 ms of which 3 ms to minimize.
[2024-05-28 00:54:26] [INFO ] Deduced a trap composed of 56 places in 617 ms of which 4 ms to minimize.
[2024-05-28 00:54:27] [INFO ] Deduced a trap composed of 281 places in 688 ms of which 5 ms to minimize.
[2024-05-28 00:54:28] [INFO ] Deduced a trap composed of 253 places in 626 ms of which 3 ms to minimize.
[2024-05-28 00:54:28] [INFO ] Deduced a trap composed of 266 places in 617 ms of which 3 ms to minimize.
[2024-05-28 00:54:29] [INFO ] Deduced a trap composed of 256 places in 592 ms of which 3 ms to minimize.
[2024-05-28 00:54:30] [INFO ] Deduced a trap composed of 328 places in 580 ms of which 3 ms to minimize.
[2024-05-28 00:54:30] [INFO ] Deduced a trap composed of 264 places in 591 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/3522 variables, and 53 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3008/1328 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3008 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:54:43] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/3522 variables, and 54 constraints, problems are : Problem set: 0 solved, 3008 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/556 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1328 constraints, Known Traps: 16/16 constraints]
After SMT, in 86844ms problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 86878ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 148378 ms. Remains : 556/556 places, 3014/3014 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 313 steps (1 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 992 reset in 699 ms.
Product exploration explored 100000 steps with 1009 reset in 722 ms.
Support contains 16 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 3014/3014 transitions.
Applied a total of 0 rules in 45 ms. Remains 556 /556 variables (removed 0) and now considering 3014/3014 (removed 0) transitions.
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:55:03] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:55:03] [INFO ] Invariant cache hit.
[2024-05-28 00:55:03] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
SMT process timed out in 46533ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 46560ms
[2024-05-28 00:55:49] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:55:49] [INFO ] Invariant cache hit.
[2024-05-28 00:55:50] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-28 00:55:50] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:55:50] [INFO ] Invariant cache hit.
[2024-05-28 00:55:51] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:56:03] [INFO ] Implicit Places using invariants and state equation in 13220 ms returned []
Implicit Place search using SMT with State Equation took 13809 ms to find 0 implicit places.
[2024-05-28 00:56:03] [INFO ] Redundant transitions in 65 ms returned []
Running 3008 sub problems to find dead transitions.
[2024-05-28 00:56:03] [INFO ] Flow matrix only has 2966 transitions (discarded 48 similar events)
[2024-05-28 00:56:03] [INFO ] Invariant cache hit.
[2024-05-28 00:56:03] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3008 unsolved
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 0 ms to minimize.
[2024-05-28 00:56:56] [INFO ] Deduced a trap composed of 266 places in 843 ms of which 3 ms to minimize.
[2024-05-28 00:56:57] [INFO ] Deduced a trap composed of 56 places in 598 ms of which 3 ms to minimize.
[2024-05-28 00:56:57] [INFO ] Deduced a trap composed of 281 places in 618 ms of which 3 ms to minimize.
[2024-05-28 00:56:58] [INFO ] Deduced a trap composed of 253 places in 656 ms of which 3 ms to minimize.
[2024-05-28 00:56:59] [INFO ] Deduced a trap composed of 266 places in 573 ms of which 4 ms to minimize.
[2024-05-28 00:56:59] [INFO ] Deduced a trap composed of 256 places in 622 ms of which 3 ms to minimize.
[2024-05-28 00:57:00] [INFO ] Deduced a trap composed of 328 places in 672 ms of which 3 ms to minimize.
[2024-05-28 00:57:01] [INFO ] Deduced a trap composed of 264 places in 605 ms of which 3 ms to minimize.
SMT process timed out in 57312ms, After SMT, problems are : Problem set: 0 solved, 3008 unsolved
Search for dead transitions found 0 dead transitions in 57358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117856 ms. Remains : 556/556 places, 3014/3014 transitions.
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-14 finished in 391078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G(F(p1))||G(p2))))))'
Support contains 55 out of 788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 3238
Applied a total of 16 rules in 41 ms. Remains 780 /788 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:57:01] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 00:57:01] [INFO ] Computed 44 invariants in 68 ms
[2024-05-28 00:57:01] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47199ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47228ms
[2024-05-28 00:57:48] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:57:48] [INFO ] Invariant cache hit.
[2024-05-28 00:57:49] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-28 00:57:49] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:57:49] [INFO ] Invariant cache hit.
[2024-05-28 00:57:50] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 00:58:07] [INFO ] Implicit Places using invariants and state equation in 18116 ms returned []
Implicit Place search using SMT with State Equation took 18812 ms to find 0 implicit places.
Running 3232 sub problems to find dead transitions.
[2024-05-28 00:58:07] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 00:58:07] [INFO ] Invariant cache hit.
[2024-05-28 00:58:07] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 10.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 57561ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 57592ms
Starting structural reductions in LTL mode, iteration 1 : 780/788 places, 3238/3246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123686 ms. Remains : 780/788 places, 3238/3246 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J04T08-LTLCardinality-15
Stuttering criterion allowed to conclude after 212 steps with 6 reset in 3 ms.
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T08-LTLCardinality-15 finished in 123943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-28 00:59:05] [INFO ] Flatten gal took : 297 ms
[2024-05-28 00:59:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 00:59:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 788 places, 3246 transitions and 19822 arcs took 46 ms.
Total runtime 2093826 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 788
TRANSITIONS: 3246
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.084s, Sys 0.014s]


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


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

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

Process ID: 1579
MODEL NAME: /home/mcc/execution/421/model
788 places, 3246 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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

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-S06J04T08"
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-S06J04T08, 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-171654445400187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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