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.r290-tajo-171654446300091.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 itstools
Input is PolyORBLF-COL-S02J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 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.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716903507393

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 13:38:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:38:28] [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 13:38:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:38:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 753 ms
[2024-05-28 13:38:29] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 13:38:29] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 13:38:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-06 TRUE 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 40000 steps (15 resets) in 1706 ms. (23 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40002 steps (15 resets) in 257 ms. (155 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (15 resets) in 299 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 485 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (24 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (19 resets) in 324 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (17 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (11 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
[2024-05-28 13:38:31] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:38:31] [INFO ] Computed 26 invariants in 6 ms
[2024-05-28 13:38:31] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 39/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/57 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/79 variables, 14/24 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 3 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/50 variables, 4/8 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/75 variables, 13/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 8 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 2/24 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/77 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/79 variables, 2/27 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 143/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 0 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 949ms 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-S02J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:32] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-28 13:38:32] [INFO ] Flatten gal took : 48 ms
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:32] [INFO ] Flatten gal took : 17 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:38:32] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 76 ms.
[2024-05-28 13:38:32] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 170 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 72 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:38:32] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-05-28 13:38:32] [INFO ] Computed 52 invariants in 82 ms
[2024-05-28 13:38:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 4 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:38:49] [INFO ] Deduced a trap composed of 230 places in 417 ms of which 6 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 379 places in 385 ms of which 6 ms to minimize.
[2024-05-28 13:39:10] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:39:10] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:39:15] [INFO ] Deduced a trap composed of 350 places in 424 ms of which 6 ms to minimize.
SMT process timed out in 42657ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42680ms
[2024-05-28 13:39:15] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:39:15] [INFO ] Invariant cache hit.
[2024-05-28 13:39:15] [INFO ] Implicit Places using invariants in 488 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 499 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 12 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43291 ms. Remains : 730/752 places, 1402/1412 transitions.
Support contains 170 out of 730 places after structural reductions.
[2024-05-28 13:39:15] [INFO ] Flatten gal took : 94 ms
[2024-05-28 13:39:15] [INFO ] Flatten gal took : 77 ms
[2024-05-28 13:39:16] [INFO ] Input system was already deterministic with 1402 transitions.
RANDOM walk for 15586 steps (5 resets) in 216 ms. (71 steps per ms) remains 0/13 properties
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1402/1402 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 730 transition count 1362
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 690 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 680 transition count 1352
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 100 place count 680 transition count 1282
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 240 place count 610 transition count 1282
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 400 place count 530 transition count 1202
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 410 place count 520 transition count 1192
Iterating global reduction 3 with 10 rules applied. Total rules applied 420 place count 520 transition count 1192
Applied a total of 420 rules in 147 ms. Remains 520 /730 variables (removed 210) and now considering 1192/1402 (removed 210) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:39:16] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 520 cols
[2024-05-28 13:39:16] [INFO ] Computed 42 invariants in 29 ms
[2024-05-28 13:39:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:39:26] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:39:26] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:39:26] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:39:26] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 258 places in 302 ms of which 3 ms to minimize.
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 223 places in 279 ms of which 3 ms to minimize.
[2024-05-28 13:39:29] [INFO ] Deduced a trap composed of 252 places in 318 ms of which 4 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 217 places in 277 ms of which 4 ms to minimize.
SMT process timed out in 22211ms, After SMT, problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 22225ms
[2024-05-28 13:39:38] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:39:38] [INFO ] Invariant cache hit.
[2024-05-28 13:39:39] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 13:39:39] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:39:39] [INFO ] Invariant cache hit.
[2024-05-28 13:39:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:39:43] [INFO ] Implicit Places using invariants and state equation in 4678 ms returned []
Implicit Place search using SMT with State Equation took 5087 ms to find 0 implicit places.
[2024-05-28 13:39:43] [INFO ] Redundant transitions in 93 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:39:44] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:39:44] [INFO ] Invariant cache hit.
[2024-05-28 13:39:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 3 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:39:56] [INFO ] Deduced a trap composed of 279 places in 363 ms of which 4 ms to minimize.
[2024-05-28 13:39:56] [INFO ] Deduced a trap composed of 223 places in 355 ms of which 6 ms to minimize.
[2024-05-28 13:39:57] [INFO ] Deduced a trap composed of 240 places in 329 ms of which 3 ms to minimize.
[2024-05-28 13:40:09] [INFO ] Deduced a trap composed of 217 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 212 places in 415 ms of which 3 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 216 places in 302 ms of which 3 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:40:15] [INFO ] Deduced a trap composed of 310 places in 329 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:40:32] [INFO ] Deduced a trap composed of 107 places in 268 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 62007ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 62023ms
Starting structural reductions in SI_LTL mode, iteration 1 : 520/730 places, 1192/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89596 ms. Remains : 520/730 places, 1192/1402 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-02
Product exploration explored 100000 steps with 2317 reset in 488 ms.
Product exploration explored 100000 steps with 2311 reset in 388 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 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 176 steps (0 resets) in 7 ms. (22 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 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-28 13:40:47] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:40:47] [INFO ] Invariant cache hit.
[2024-05-28 13:40:48] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-05-28 13:40:48] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 82 ms returned sat
[2024-05-28 13:40:49] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2024-05-28 13:40:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:40:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 72 ms returned sat
[2024-05-28 13:40:50] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 46 ms returned sat
[2024-05-28 13:40:52] [INFO ] [Nat]Absence check using state equation in 2070 ms returned sat
[2024-05-28 13:40:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:40:52] [INFO ] [Nat]Added 120 Read/Feed constraints in 617 ms returned sat
[2024-05-28 13:40:53] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:40:53] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:40:54] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:40:54] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 2 ms to minimize.
[2024-05-28 13:40:55] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:40:55] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:40:55] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:40:56] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:40:56] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:40:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3551 ms
[2024-05-28 13:40:56] [INFO ] Computed and/alt/rep : 410/868/400 causal constraints (skipped 770 transitions) in 141 ms.
[2024-05-28 13:40:58] [INFO ] Added : 95 causal constraints over 19 iterations in 2413 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 1192/1192 transitions.
Applied a total of 0 rules in 58 ms. Remains 520 /520 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:40:59] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:40:59] [INFO ] Invariant cache hit.
[2024-05-28 13:40:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:41:11] [INFO ] Deduced a trap composed of 279 places in 371 ms of which 4 ms to minimize.
[2024-05-28 13:41:11] [INFO ] Deduced a trap composed of 223 places in 322 ms of which 3 ms to minimize.
[2024-05-28 13:41:11] [INFO ] Deduced a trap composed of 240 places in 247 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 53 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:41:27] [INFO ] Deduced a trap composed of 310 places in 247 ms of which 3 ms to minimize.
[2024-05-28 13:41:28] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 6 ms to minimize.
[2024-05-28 13:41:36] [INFO ] Deduced a trap composed of 229 places in 322 ms of which 4 ms to minimize.
[2024-05-28 13:41:37] [INFO ] Deduced a trap composed of 231 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:41:37] [INFO ] Deduced a trap composed of 216 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:41:38] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 42617ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42637ms
[2024-05-28 13:41:41] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:41:41] [INFO ] Invariant cache hit.
[2024-05-28 13:41:42] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 13:41:42] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:41:42] [INFO ] Invariant cache hit.
[2024-05-28 13:41:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:41:47] [INFO ] Implicit Places using invariants and state equation in 5207 ms returned []
Implicit Place search using SMT with State Equation took 5679 ms to find 0 implicit places.
[2024-05-28 13:41:47] [INFO ] Redundant transitions in 82 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:41:47] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:41:47] [INFO ] Invariant cache hit.
[2024-05-28 13:41:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:42:00] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:42:00] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:42:00] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:42:00] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:42:01] [INFO ] Deduced a trap composed of 279 places in 332 ms of which 3 ms to minimize.
[2024-05-28 13:42:01] [INFO ] Deduced a trap composed of 223 places in 306 ms of which 4 ms to minimize.
[2024-05-28 13:42:01] [INFO ] Deduced a trap composed of 240 places in 280 ms of which 3 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 217 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 212 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:42:16] [INFO ] Deduced a trap composed of 216 places in 262 ms of which 3 ms to minimize.
[2024-05-28 13:42:16] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 57 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/519 variables, 1/58 constraints. Problems are: Problem set: 60 solved, 1130 unsolved
[2024-05-28 13:42:42] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:42:43] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:42:43] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1692 variables, and 61 constraints, problems are : Problem set: 60 solved, 1130 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 20/20 constraints]
After SMT, in 62431ms problems are : Problem set: 60 solved, 1130 unsolved
Search for dead transitions found 60 dead transitions in 62452ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 520/520 places, 1132/1192 transitions.
Applied a total of 0 rules in 37 ms. Remains 520 /520 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2024-05-28 13:42:49] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 111011 ms. Remains : 520/520 places, 1132/1192 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 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 164 steps (0 resets) in 5 ms. (27 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 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-28 13:42:50] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
// Phase 1: matrix 1112 rows 520 cols
[2024-05-28 13:42:50] [INFO ] Computed 42 invariants in 28 ms
[2024-05-28 13:42:51] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-05-28 13:42:51] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 238 ms returned sat
[2024-05-28 13:42:53] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2024-05-28 13:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:42:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-05-28 13:42:53] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 77 ms returned sat
[2024-05-28 13:42:56] [INFO ] [Nat]Absence check using state equation in 2340 ms returned sat
[2024-05-28 13:42:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:42:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 883 ms returned sat
[2024-05-28 13:42:57] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-05-28 13:42:58] [INFO ] Deduced a trap composed of 37 places in 334 ms of which 3 ms to minimize.
[2024-05-28 13:42:59] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-28 13:42:59] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:43:00] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:43:00] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:43:00] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:43:01] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:43:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:43:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5036 ms
[2024-05-28 13:43:02] [INFO ] Computed and/alt/rep : 450/1268/440 causal constraints (skipped 670 transitions) in 122 ms.
[2024-05-28 13:43:04] [INFO ] Added : 117 causal constraints over 24 iterations in 2861 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2315 reset in 508 ms.
Product exploration explored 100000 steps with 2320 reset in 470 ms.
Built C files in :
/tmp/ltsmin3585479429492002787
[2024-05-28 13:43:06] [INFO ] Computing symmetric may disable matrix : 1132 transitions.
[2024-05-28 13:43:06] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:06] [INFO ] Computing symmetric may enable matrix : 1132 transitions.
[2024-05-28 13:43:06] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:06] [INFO ] Computing Do-Not-Accords matrix : 1132 transitions.
[2024-05-28 13:43:06] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:06] [INFO ] Built C files in 338ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3585479429492002787
Running compilation step : cd /tmp/ltsmin3585479429492002787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3585479429492002787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3585479429492002787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 32 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 1132/1132 transitions.
Applied a total of 0 rules in 44 ms. Remains 520 /520 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2024-05-28 13:43:09] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-28 13:43:09] [INFO ] Invariant cache hit.
[2024-05-28 13:43:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:43:19] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:43:20] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:43:20] [INFO ] Deduced a trap composed of 209 places in 314 ms of which 4 ms to minimize.
[2024-05-28 13:43:21] [INFO ] Deduced a trap composed of 208 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:43:22] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 5 ms to minimize.
[2024-05-28 13:43:22] [INFO ] Deduced a trap composed of 222 places in 246 ms of which 3 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 237 places in 212 ms of which 5 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 227 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 217 places in 291 ms of which 4 ms to minimize.
[2024-05-28 13:43:25] [INFO ] Deduced a trap composed of 310 places in 273 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1632 variables, and 58 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-28 13:43:33] [INFO ] Deduced a trap composed of 262 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:43:33] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2024-05-28 13:43:33] [INFO ] Deduced a trap composed of 270 places in 256 ms of which 4 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:43:44] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 4 ms to minimize.
[2024-05-28 13:43:44] [INFO ] Deduced a trap composed of 115 places in 216 ms of which 4 ms to minimize.
[2024-05-28 13:43:45] [INFO ] Deduced a trap composed of 194 places in 237 ms of which 4 ms to minimize.
[2024-05-28 13:43:46] [INFO ] Deduced a trap composed of 231 places in 292 ms of which 4 ms to minimize.
[2024-05-28 13:43:46] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1632 variables, and 67 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 27/27 constraints]
After SMT, in 41885ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 41905ms
[2024-05-28 13:43:51] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-28 13:43:51] [INFO ] Invariant cache hit.
[2024-05-28 13:43:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-28 13:43:51] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-28 13:43:51] [INFO ] Invariant cache hit.
[2024-05-28 13:43:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:43:57] [INFO ] Implicit Places using invariants and state equation in 6202 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
[2024-05-28 13:43:57] [INFO ] Redundant transitions in 20 ms returned []
Running 1130 sub problems to find dead transitions.
[2024-05-28 13:43:57] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-28 13:43:57] [INFO ] Invariant cache hit.
[2024-05-28 13:43:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:44:09] [INFO ] Deduced a trap composed of 209 places in 331 ms of which 4 ms to minimize.
[2024-05-28 13:44:09] [INFO ] Deduced a trap composed of 208 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:44:11] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 4 ms to minimize.
[2024-05-28 13:44:11] [INFO ] Deduced a trap composed of 222 places in 310 ms of which 4 ms to minimize.
[2024-05-28 13:44:11] [INFO ] Deduced a trap composed of 237 places in 305 ms of which 4 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 227 places in 293 ms of which 4 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 217 places in 283 ms of which 3 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 310 places in 270 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1632 variables, and 58 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-28 13:44:32] [INFO ] Deduced a trap composed of 262 places in 320 ms of which 4 ms to minimize.
[2024-05-28 13:44:32] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:44:32] [INFO ] Deduced a trap composed of 270 places in 277 ms of which 3 ms to minimize.
[2024-05-28 13:44:35] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 1 ms to minimize.
[2024-05-28 13:44:44] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:44:45] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 4 ms to minimize.
[2024-05-28 13:44:45] [INFO ] Deduced a trap composed of 194 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:44:46] [INFO ] Deduced a trap composed of 231 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:44:47] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-28 13:44:57] [INFO ] Deduced a trap composed of 286 places in 317 ms of which 3 ms to minimize.
[2024-05-28 13:44:58] [INFO ] Deduced a trap composed of 277 places in 284 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1632 variables, and 69 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 29/29 constraints]
After SMT, in 61825ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 61842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110346 ms. Remains : 520/520 places, 1132/1132 transitions.
Built C files in :
/tmp/ltsmin10727583517016255055
[2024-05-28 13:44:59] [INFO ] Computing symmetric may disable matrix : 1132 transitions.
[2024-05-28 13:44:59] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:44:59] [INFO ] Computing symmetric may enable matrix : 1132 transitions.
[2024-05-28 13:44:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:45:00] [INFO ] Computing Do-Not-Accords matrix : 1132 transitions.
[2024-05-28 13:45:00] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:45:00] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10727583517016255055
Running compilation step : cd /tmp/ltsmin10727583517016255055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10727583517016255055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10727583517016255055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 13:45:03] [INFO ] Flatten gal took : 84 ms
[2024-05-28 13:45:03] [INFO ] Flatten gal took : 69 ms
[2024-05-28 13:45:03] [INFO ] Time to serialize gal into /tmp/LTL7140701593625106301.gal : 14 ms
[2024-05-28 13:45:03] [INFO ] Time to serialize properties into /tmp/LTL12497576308649853503.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7140701593625106301.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7627018554511321212.hoa' '-atoms' '/tmp/LTL12497576308649853503.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12497576308649853503.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7627018554511321212.hoa
Detected timeout of ITS tools.
[2024-05-28 13:45:18] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:45:18] [INFO ] Flatten gal took : 66 ms
[2024-05-28 13:45:18] [INFO ] Time to serialize gal into /tmp/LTL8657885621886228761.gal : 14 ms
[2024-05-28 13:45:18] [INFO ] Time to serialize properties into /tmp/LTL16646929521328777079.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8657885621886228761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16646929521328777079.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((ModifiedSrc_0+ModifiedSrc_1)<2)&&(((((NotifyEventSourceAddedE_0+NotifyEventSourceAddedE_1)+(NotifyEventSourceAddedE_2+NotifyE...755
Formula 0 simplified : G!"(((ModifiedSrc_0+ModifiedSrc_1)<2)&&(((((NotifyEventSourceAddedE_0+NotifyEventSourceAddedE_1)+(NotifyEventSourceAddedE_2+NotifyEv...751
Detected timeout of ITS tools.
[2024-05-28 13:45:33] [INFO ] Flatten gal took : 86 ms
[2024-05-28 13:45:33] [INFO ] Applying decomposition
[2024-05-28 13:45:34] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16783107214028183004.txt' '-o' '/tmp/graph16783107214028183004.bin' '-w' '/tmp/graph16783107214028183004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16783107214028183004.bin' '-l' '-1' '-v' '-w' '/tmp/graph16783107214028183004.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:34] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:34] [INFO ] Removed a total of 1057 redundant transitions.
[2024-05-28 13:45:34] [INFO ] Flatten gal took : 230 ms
[2024-05-28 13:45:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 740 labels/synchronizations in 48 ms.
[2024-05-28 13:45:34] [INFO ] Time to serialize gal into /tmp/LTL1508334064805984505.gal : 21 ms
[2024-05-28 13:45:34] [INFO ] Time to serialize properties into /tmp/LTL5278709155570987323.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1508334064805984505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5278709155570987323.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((gi0.gi1.gi2.gu39.ModifiedSrc_0+gi0.gi1.gi2.gu39.ModifiedSrc_1)<2)&&(((((gu24.NotifyEventSourceAddedE_0+gu24.NotifyEventSource...939
Formula 0 simplified : G!"(((gi0.gi1.gi2.gu39.ModifiedSrc_0+gi0.gi1.gi2.gu39.ModifiedSrc_1)<2)&&(((((gu24.NotifyEventSourceAddedE_0+gu24.NotifyEventSourceA...935
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-02 finished in 393661 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) U X(p1)))'
Support contains 11 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 720 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 720 transition count 1392
Applied a total of 20 rules in 32 ms. Remains 720 /730 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:45:50] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 13:45:50] [INFO ] Computed 42 invariants in 61 ms
[2024-05-28 13:45:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:46:06] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 6 ms to minimize.
[2024-05-28 13:46:06] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:46:06] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:46:07] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:46:07] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:46:07] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 49 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 224 places in 357 ms of which 5 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 368 places in 372 ms of which 5 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 437 places in 345 ms of which 5 ms to minimize.
[2024-05-28 13:46:23] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:46:24] [INFO ] Deduced a trap composed of 447 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:46:24] [INFO ] Deduced a trap composed of 490 places in 375 ms of which 5 ms to minimize.
[2024-05-28 13:46:31] [INFO ] Deduced a trap composed of 386 places in 426 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42486ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42512ms
[2024-05-28 13:46:32] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:46:32] [INFO ] Invariant cache hit.
[2024-05-28 13:46:33] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-28 13:46:33] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:46:33] [INFO ] Invariant cache hit.
[2024-05-28 13:46:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:46:42] [INFO ] Implicit Places using invariants and state equation in 9308 ms returned []
Implicit Place search using SMT with State Equation took 9852 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:46:42] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:46:42] [INFO ] Invariant cache hit.
[2024-05-28 13:46:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 428 places in 390 ms of which 6 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 412 places in 458 ms of which 5 ms to minimize.
[2024-05-28 13:47:12] [INFO ] Deduced a trap composed of 351 places in 363 ms of which 9 ms to minimize.
[2024-05-28 13:47:14] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:47:15] [INFO ] Deduced a trap composed of 160 places in 361 ms of which 5 ms to minimize.
SMT process timed out in 32613ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 32638ms
Starting structural reductions in LTL mode, iteration 1 : 720/730 places, 1392/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85049 ms. Remains : 720/730 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Product exploration explored 100000 steps with 50000 reset in 468 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-04 finished in 86235 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||X((p1 U p2))))))'
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 13 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:47:16] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 730 cols
[2024-05-28 13:47:16] [INFO ] Computed 42 invariants in 39 ms
[2024-05-28 13:47:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:47:33] [INFO ] Deduced a trap composed of 232 places in 348 ms of which 5 ms to minimize.
[2024-05-28 13:47:35] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:47:37] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 49 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:47:41] [INFO ] Deduced a trap composed of 360 places in 378 ms of which 5 ms to minimize.
[2024-05-28 13:47:41] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:47:44] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:47:52] [INFO ] Deduced a trap composed of 421 places in 393 ms of which 5 ms to minimize.
[2024-05-28 13:47:52] [INFO ] Deduced a trap composed of 421 places in 426 ms of which 6 ms to minimize.
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 409 places in 397 ms of which 5 ms to minimize.
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 429 places in 380 ms of which 5 ms to minimize.
[2024-05-28 13:47:54] [INFO ] Deduced a trap composed of 401 places in 356 ms of which 6 ms to minimize.
[2024-05-28 13:47:54] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 374 places in 344 ms of which 5 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 367 places in 303 ms of which 5 ms to minimize.
SMT process timed out in 42503ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42522ms
[2024-05-28 13:47:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:47:58] [INFO ] Invariant cache hit.
[2024-05-28 13:47:59] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-28 13:47:59] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:47:59] [INFO ] Invariant cache hit.
[2024-05-28 13:47:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:48:10] [INFO ] Implicit Places using invariants and state equation in 11596 ms returned []
Implicit Place search using SMT with State Equation took 12064 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:48:10] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:48:10] [INFO ] Invariant cache hit.
[2024-05-28 13:48:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:48:27] [INFO ] Deduced a trap composed of 379 places in 421 ms of which 5 ms to minimize.
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 398 places in 392 ms of which 5 ms to minimize.
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 236 places in 371 ms of which 5 ms to minimize.
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 3 ms to minimize.
[2024-05-28 13:48:29] [INFO ] Deduced a trap composed of 432 places in 406 ms of which 7 ms to minimize.
[2024-05-28 13:48:30] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:48:31] [INFO ] Deduced a trap composed of 387 places in 404 ms of which 6 ms to minimize.
[2024-05-28 13:48:31] [INFO ] Deduced a trap composed of 358 places in 358 ms of which 6 ms to minimize.
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 5 ms to minimize.
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 46 places in 418 ms of which 5 ms to minimize.
[2024-05-28 13:48:33] [INFO ] Deduced a trap composed of 369 places in 374 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 407 places in 370 ms of which 6 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 397 places in 388 ms of which 5 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 376 places in 418 ms of which 6 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 401 places in 298 ms of which 4 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 480 places in 369 ms of which 5 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 496 places in 366 ms of which 5 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 374 places in 316 ms of which 6 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 388 places in 371 ms of which 5 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 209 places in 354 ms of which 5 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 441 places in 312 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 73 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 33/33 constraints]
After SMT, in 62149ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62165ms
Finished structural reductions in LTL mode , in 1 iterations and 116772 ms. Remains : 730/730 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-08
Product exploration explored 100000 steps with 33448 reset in 518 ms.
Product exploration explored 100000 steps with 33250 reset in 462 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 : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 169 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (10 resets) in 300 ms. (132 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
[2024-05-28 13:49:14] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:14] [INFO ] Invariant cache hit.
[2024-05-28 13:49:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 716/2112 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/12 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 355 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 21 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:49:15] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:15] [INFO ] Invariant cache hit.
[2024-05-28 13:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 2 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:49:32] [INFO ] Deduced a trap composed of 379 places in 382 ms of which 5 ms to minimize.
[2024-05-28 13:49:32] [INFO ] Deduced a trap composed of 398 places in 385 ms of which 5 ms to minimize.
[2024-05-28 13:49:33] [INFO ] Deduced a trap composed of 236 places in 357 ms of which 5 ms to minimize.
[2024-05-28 13:49:33] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:49:34] [INFO ] Deduced a trap composed of 432 places in 398 ms of which 5 ms to minimize.
[2024-05-28 13:49:35] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 2 ms to minimize.
[2024-05-28 13:49:35] [INFO ] Deduced a trap composed of 387 places in 377 ms of which 5 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 358 places in 414 ms of which 5 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 46 places in 386 ms of which 5 ms to minimize.
[2024-05-28 13:49:37] [INFO ] Deduced a trap composed of 46 places in 390 ms of which 6 ms to minimize.
[2024-05-28 13:49:37] [INFO ] Deduced a trap composed of 369 places in 346 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:49:48] [INFO ] Deduced a trap composed of 407 places in 385 ms of which 6 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 397 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:49:52] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:49:56] [INFO ] Deduced a trap composed of 376 places in 292 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 66 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 26/26 constraints]
After SMT, in 42292ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42308ms
[2024-05-28 13:49:57] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:57] [INFO ] Invariant cache hit.
[2024-05-28 13:49:58] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-28 13:49:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:58] [INFO ] Invariant cache hit.
[2024-05-28 13:49:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:50:09] [INFO ] Implicit Places using invariants and state equation in 10851 ms returned []
Implicit Place search using SMT with State Equation took 11423 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:50:09] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:50:09] [INFO ] Invariant cache hit.
[2024-05-28 13:50:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 379 places in 376 ms of which 6 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 398 places in 366 ms of which 5 ms to minimize.
[2024-05-28 13:50:28] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:50:28] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:50:29] [INFO ] Deduced a trap composed of 432 places in 368 ms of which 5 ms to minimize.
[2024-05-28 13:50:29] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 2 ms to minimize.
[2024-05-28 13:50:30] [INFO ] Deduced a trap composed of 387 places in 408 ms of which 6 ms to minimize.
[2024-05-28 13:50:31] [INFO ] Deduced a trap composed of 358 places in 315 ms of which 4 ms to minimize.
[2024-05-28 13:50:31] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 4 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 46 places in 331 ms of which 3 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 369 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.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 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 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 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.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 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:50:53] [INFO ] Deduced a trap composed of 407 places in 349 ms of which 5 ms to minimize.
[2024-05-28 13:50:55] [INFO ] Deduced a trap composed of 397 places in 346 ms of which 6 ms to minimize.
[2024-05-28 13:50:56] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:50:56] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:50:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:51:00] [INFO ] Deduced a trap composed of 376 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 401 places in 266 ms of which 3 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 480 places in 251 ms of which 4 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 496 places in 319 ms of which 4 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 374 places in 338 ms of which 3 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 388 places in 290 ms of which 8 ms to minimize.
[2024-05-28 13:51:06] [INFO ] Deduced a trap composed of 209 places in 299 ms of which 4 ms to minimize.
[2024-05-28 13:51:07] [INFO ] Deduced a trap composed of 441 places in 316 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 73 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 33/33 constraints]
After SMT, in 62267ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62309ms
Finished structural reductions in LTL mode , in 1 iterations and 116074 ms. Remains : 730/730 places, 1402/1402 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 : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1941 steps (2 resets) in 17 ms. (107 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33284 reset in 371 ms.
Product exploration explored 100000 steps with 33376 reset in 466 ms.
Built C files in :
/tmp/ltsmin14170275686115503234
[2024-05-28 13:51:13] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14170275686115503234
Running compilation step : cd /tmp/ltsmin14170275686115503234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2951 ms.
Running link step : cd /tmp/ltsmin14170275686115503234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin14170275686115503234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3430396388909758799.hoa' '--buchi-type=spotba'
LTSmin run took 1962 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 241985 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((p0||(p1 U p2))))'
Support contains 70 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 730 transition count 1352
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 680 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 670 transition count 1342
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 120 place count 670 transition count 1282
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 240 place count 610 transition count 1282
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 380 place count 540 transition count 1212
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 390 place count 530 transition count 1202
Iterating global reduction 3 with 10 rules applied. Total rules applied 400 place count 530 transition count 1202
Applied a total of 400 rules in 60 ms. Remains 530 /730 variables (removed 200) and now considering 1202/1402 (removed 200) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 13:51:18] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 530 cols
[2024-05-28 13:51:18] [INFO ] Computed 42 invariants in 13 ms
[2024-05-28 13:51:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:51:30] [INFO ] Deduced a trap composed of 249 places in 291 ms of which 3 ms to minimize.
[2024-05-28 13:51:31] [INFO ] Deduced a trap composed of 244 places in 316 ms of which 4 ms to minimize.
[2024-05-28 13:51:35] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
[2024-05-28 13:51:36] [INFO ] Deduced a trap composed of 212 places in 265 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 53 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:51:43] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:51:43] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
[2024-05-28 13:51:45] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 320 places in 282 ms of which 4 ms to minimize.
[2024-05-28 13:51:49] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 172 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:51:57] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 60 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 42039ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42052ms
[2024-05-28 13:52:00] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:52:00] [INFO ] Invariant cache hit.
[2024-05-28 13:52:00] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-28 13:52:00] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:52:00] [INFO ] Invariant cache hit.
[2024-05-28 13:52:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:52:08] [INFO ] Implicit Places using invariants and state equation in 7207 ms returned []
Implicit Place search using SMT with State Equation took 7619 ms to find 0 implicit places.
[2024-05-28 13:52:08] [INFO ] Redundant transitions in 16 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 13:52:08] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:52:08] [INFO ] Invariant cache hit.
[2024-05-28 13:52:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:52:19] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:52:19] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 231 places in 336 ms of which 4 ms to minimize.
[2024-05-28 13:52:22] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
[2024-05-28 13:52:32] [INFO ] Deduced a trap composed of 218 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:52:33] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:52:38] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:52:46] [INFO ] Deduced a trap composed of 320 places in 299 ms of which 3 ms to minimize.
[2024-05-28 13:52:47] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:53:09] [INFO ] Deduced a trap composed of 115 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 57 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 17/17 constraints]
After SMT, in 61741ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61756ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/730 places, 1202/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111527 ms. Remains : 530/730 places, 1202/1402 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-13
Product exploration explored 100000 steps with 822 reset in 493 ms.
Product exploration explored 100000 steps with 770 reset in 656 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 : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (OR p0 p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (12 resets) in 343 ms. (116 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 670 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 678 ms. (58 steps per ms) remains 2/2 properties
[2024-05-28 13:53:11] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:53:11] [INFO ] Invariant cache hit.
[2024-05-28 13:53:11] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 225/295 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/305 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/525 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/528 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1182/1710 variables, 528/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 120/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1710 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1712 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1712 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 692 constraints, problems are : Problem set: 0 solved, 2 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 530/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 225/295 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:53:13] [INFO ] Deduced a trap composed of 184 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 220/525 variables, 29/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 13:53:13] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:53:13] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 4 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 207 places in 319 ms of which 4 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 3 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 3 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 3 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Int declared 525/1712 variables, and 50 constraints, problems are : Problem set: 2 solved, 0 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 4233ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (OR p0 p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 20 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 40 out of 530 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1202/1202 transitions.
Applied a total of 0 rules in 28 ms. Remains 530 /530 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 13:53:16] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:53:16] [INFO ] Invariant cache hit.
[2024-05-28 13:53:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:53:27] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-28 13:53:27] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:53:27] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 231 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:53:31] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 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 Real declared 528/1712 variables, and 51 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:53:45] [INFO ] Deduced a trap composed of 336 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:53:46] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-28 13:53:49] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 195 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:53:58] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 58 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 18/18 constraints]
After SMT, in 42222ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42235ms
[2024-05-28 13:53:58] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:53:58] [INFO ] Invariant cache hit.
[2024-05-28 13:53:59] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-28 13:53:59] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:53:59] [INFO ] Invariant cache hit.
[2024-05-28 13:53:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:54:06] [INFO ] Implicit Places using invariants and state equation in 7234 ms returned []
Implicit Place search using SMT with State Equation took 7710 ms to find 0 implicit places.
[2024-05-28 13:54:06] [INFO ] Redundant transitions in 9 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 13:54:06] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:54:06] [INFO ] Invariant cache hit.
[2024-05-28 13:54:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 231 places in 299 ms of which 4 ms to minimize.
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 218 places in 271 ms of which 4 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 320 places in 263 ms of which 4 ms to minimize.
[2024-05-28 13:54:47] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 56 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 16/16 constraints]
After SMT, in 62238ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 62254ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112252 ms. Remains : 530/530 places, 1202/1202 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 : [(AND p0 p2), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 318 steps (0 resets) in 10 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 786 reset in 318 ms.
Product exploration explored 100000 steps with 771 reset in 516 ms.
Built C files in :
/tmp/ltsmin8966292747932257712
[2024-05-28 13:55:10] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-28 13:55:10] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:10] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-28 13:55:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:10] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-28 13:55:11] [INFO ] Computation of Completed DNA matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:11] [INFO ] Built C files in 426ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8966292747932257712
Running compilation step : cd /tmp/ltsmin8966292747932257712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8966292747932257712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8966292747932257712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 40 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1202/1202 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 530 transition count 1182
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 510 transition count 1182
Applied a total of 40 rules in 58 ms. Remains 510 /530 variables (removed 20) and now considering 1182/1202 (removed 20) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:55:14] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-05-28 13:55:14] [INFO ] Computed 42 invariants in 32 ms
[2024-05-28 13:55:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 223 places in 312 ms of which 3 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 3 ms to minimize.
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:55:33] [INFO ] Deduced a trap composed of 217 places in 214 ms of which 3 ms to minimize.
(s428 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.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 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 9.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 6.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 53 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:55:38] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 3 ms to minimize.
[2024-05-28 13:55:38] [INFO ] Deduced a trap composed of 221 places in 291 ms of which 3 ms to minimize.
[2024-05-28 13:55:42] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:55:51] [INFO ] Deduced a trap composed of 171 places in 340 ms of which 4 ms to minimize.
[2024-05-28 13:55:52] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 3 ms to minimize.
[2024-05-28 13:55:53] [INFO ] Deduced a trap composed of 109 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 59 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 42341ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42365ms
[2024-05-28 13:55:56] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:55:56] [INFO ] Invariant cache hit.
[2024-05-28 13:55:56] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-28 13:55:56] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:55:56] [INFO ] Invariant cache hit.
[2024-05-28 13:55:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:56:02] [INFO ] Implicit Places using invariants and state equation in 5988 ms returned []
Implicit Place search using SMT with State Equation took 6402 ms to find 0 implicit places.
[2024-05-28 13:56:02] [INFO ] Redundant transitions in 22 ms returned []
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:56:03] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:56:03] [INFO ] Invariant cache hit.
[2024-05-28 13:56:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 221 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:56:15] [INFO ] Deduced a trap composed of 183 places in 344 ms of which 4 ms to minimize.
[2024-05-28 13:56:15] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 4 ms to minimize.
[2024-05-28 13:56:15] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 3 ms to minimize.
[2024-05-28 13:56:16] [INFO ] Deduced a trap composed of 216 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:56:16] [INFO ] Deduced a trap composed of 203 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 111 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
(s61 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 57 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 176 places in 286 ms of which 8 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(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 9)
(s193 0)
(s194 1)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 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 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(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)
(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 0)
(s318 0)
(s319 0)
(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 1)
(s354 1)
(s355 1)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 4)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 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 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 61 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 21/21 constraints]
After SMT, in 62318ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 510/530 places, 1182/1202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111208 ms. Remains : 510/530 places, 1182/1202 transitions.
Built C files in :
/tmp/ltsmin9491862882405259220
[2024-05-28 13:57:05] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2024-05-28 13:57:05] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:05] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2024-05-28 13:57:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:05] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2024-05-28 13:57:05] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:05] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491862882405259220
Running compilation step : cd /tmp/ltsmin9491862882405259220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9491862882405259220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9491862882405259220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 13:57:08] [INFO ] Flatten gal took : 83 ms
[2024-05-28 13:57:08] [INFO ] Flatten gal took : 63 ms
[2024-05-28 13:57:08] [INFO ] Time to serialize gal into /tmp/LTL13032690373042816291.gal : 8 ms
[2024-05-28 13:57:08] [INFO ] Time to serialize properties into /tmp/LTL1429160522974004935.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13032690373042816291.gal' '-t' 'CGAL' '-hoa' '/tmp/aut901833794728921581.hoa' '-atoms' '/tmp/LTL1429160522974004935.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1429160522974004935.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut901833794728921581.hoa
Detected timeout of ITS tools.
[2024-05-28 13:57:23] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:57:24] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:57:24] [INFO ] Time to serialize gal into /tmp/LTL12189599689026049770.gal : 14 ms
[2024-05-28 13:57:24] [INFO ] Time to serialize properties into /tmp/LTL6166673629582447301.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12189599689026049770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6166673629582447301.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventS...1480
Formula 0 simplified : F(!"(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventSo...1477
Detected timeout of ITS tools.
[2024-05-28 13:57:39] [INFO ] Flatten gal took : 59 ms
[2024-05-28 13:57:39] [INFO ] Applying decomposition
[2024-05-28 13:57:39] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7331647126414218236.txt' '-o' '/tmp/graph7331647126414218236.bin' '-w' '/tmp/graph7331647126414218236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7331647126414218236.bin' '-l' '-1' '-v' '-w' '/tmp/graph7331647126414218236.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:57:39] [INFO ] Decomposing Gal with order
[2024-05-28 13:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:57:39] [INFO ] Removed a total of 1109 redundant transitions.
[2024-05-28 13:57:39] [INFO ] Flatten gal took : 155 ms
[2024-05-28 13:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 767 labels/synchronizations in 40 ms.
[2024-05-28 13:57:39] [INFO ] Time to serialize gal into /tmp/LTL2070130896109118758.gal : 7 ms
[2024-05-28 13:57:39] [INFO ] Time to serialize properties into /tmp/LTL3220771735778538052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2070130896109118758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3220771735778538052.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(((((gu25.NotifyEventSourceAddedB_0+gu25.NotifyEventSourceAddedB_1)+(gu25.NotifyEventSourceAddedB_2+gu25.NotifyEventSourceAdded...1830
Formula 0 simplified : F(!"(((((gu25.NotifyEventSourceAddedB_0+gu25.NotifyEventSourceAddedB_1)+(gu25.NotifyEventSourceAddedB_2+gu25.NotifyEventSourceAddedB...1827
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-13 finished in 396544 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))'
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((p0||(p1 U p2))))'
[2024-05-28 13:57:55] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5118500840089939934
[2024-05-28 13:57:55] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-28 13:57:55] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:55] [INFO ] Applying decomposition
[2024-05-28 13:57:55] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-28 13:57:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:55] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16704760592903475083.txt' '-o' '/tmp/graph16704760592903475083.bin' '-w' '/tmp/graph16704760592903475083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16704760592903475083.bin' '-l' '-1' '-v' '-w' '/tmp/graph16704760592903475083.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:57:55] [INFO ] Decomposing Gal with order
[2024-05-28 13:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:57:55] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-28 13:57:55] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:55] [INFO ] Built C files in 457ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5118500840089939934
Running compilation step : cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 13:57:55] [INFO ] Removed a total of 1663 redundant transitions.
[2024-05-28 13:57:55] [INFO ] Flatten gal took : 190 ms
[2024-05-28 13:57:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 968 labels/synchronizations in 45 ms.
[2024-05-28 13:57:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality9444404930344757949.gal : 12 ms
[2024-05-28 13:57:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality15213817792554274406.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9444404930344757949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15213817792554274406.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F("(((gi2.gi1.gi1.gu98.ModifiedSrc_0+gi2.gi1.gi1.gu98.ModifiedSrc_1)<2)&&(((((gu56.NotifyEventSourceAddedE_0+gu56.NotifyEventSource...939
Formula 0 simplified : G!"(((gi2.gi1.gi1.gu98.ModifiedSrc_0+gi2.gi1.gi1.gu98.ModifiedSrc_1)<2)&&(((((gu56.NotifyEventSourceAddedE_0+gu56.NotifyEventSourceA...935
Compilation finished in 5642 ms.
Running link step : cd /tmp/ltsmin5118500840089939934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 128 ms.
Running LTSmin : cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 425959 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 14:14:00] [INFO ] Applying decomposition
[2024-05-28 14:14:00] [INFO ] Flatten gal took : 123 ms
[2024-05-28 14:14:00] [INFO ] Decomposing Gal with order
[2024-05-28 14:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:14:00] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[DataOnSrc_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:14:00] [INFO ] Flatten gal took : 100 ms
[2024-05-28 14:14:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality15783414559375216722.gal : 24 ms
[2024-05-28 14:14:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality15610179264361771202.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15783414559375216722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15610179264361771202.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(("(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventS...1480
Formula 0 simplified : F(!"(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventSo...1477
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 14:32:17] [INFO ] Flatten gal took : 129 ms
[2024-05-28 14:32:17] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-05-28 14:32:17] [INFO ] Transformed 730 places.
[2024-05-28 14:32:17] [INFO ] Transformed 1402 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:32:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality1592708571556099527.gal : 28 ms
[2024-05-28 14:32:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality10045599230637856008.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1592708571556099527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10045599230637856008.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventS...1480
Formula 0 simplified : F(!"(((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+((NotifyEventSo...1477
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.268: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.272: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.278: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.300: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.304: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.315: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.323: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.323: Initializing POR dependencies: labels 1406, guards 1402
pins2lts-mc-linux64( 1/ 8), 0.327: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 34.565: LTL layer: formula: [](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))
pins2lts-mc-linux64( 7/ 8), 34.566: "[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 34.566: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 35.260: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 35.636: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 35.669: There are 1408 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 35.669: State length is 731, there are 1410 groups
pins2lts-mc-linux64( 0/ 8), 35.669: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 35.669: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 35.669: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 35.669: Visible groups: 0 / 1410, labels: 3 / 1408
pins2lts-mc-linux64( 0/ 8), 35.669: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 35.669: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 35.835: [Blue] ~74 levels ~960 states ~2952 transitions
pins2lts-mc-linux64( 3/ 8), 36.024: [Blue] ~158 levels ~1920 states ~6240 transitions
pins2lts-mc-linux64( 3/ 8), 36.294: [Blue] ~158 levels ~3840 states ~8792 transitions
pins2lts-mc-linux64( 3/ 8), 36.840: [Blue] ~158 levels ~7680 states ~13736 transitions
pins2lts-mc-linux64( 1/ 8), 38.783: [Blue] ~1056 levels ~15360 states ~53160 transitions
pins2lts-mc-linux64( 7/ 8), 41.738: [Blue] ~528 levels ~30720 states ~51192 transitions
pins2lts-mc-linux64( 5/ 8), 44.906: [Blue] ~2801 levels ~61440 states ~153184 transitions
pins2lts-mc-linux64( 5/ 8), 48.182: [Blue] ~4732 levels ~122880 states ~284600 transitions
pins2lts-mc-linux64( 5/ 8), 54.047: [Blue] ~8569 levels ~245760 states ~547952 transitions
pins2lts-mc-linux64( 5/ 8), 66.013: [Blue] ~19192 levels ~491520 states ~1191344 transitions
pins2lts-mc-linux64( 5/ 8), 89.426: [Blue] ~33289 levels ~983040 states ~2261928 transitions
pins2lts-mc-linux64( 5/ 8), 132.898: [Blue] ~48827 levels ~1966080 states ~3979656 transitions
pins2lts-mc-linux64( 5/ 8), 228.502: [Blue] ~139109 levels ~3932160 states ~9540744 transitions
pins2lts-mc-linux64( 4/ 8), 417.463: [Blue] ~575969 levels ~7864320 states ~28988624 transitions
pins2lts-mc-linux64( 4/ 8), 804.395: [Blue] ~1104706 levels ~15728640 states ~57282864 transitions
pins2lts-mc-linux64( 2/ 8), 1085.524: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1085.920:
pins2lts-mc-linux64( 0/ 8), 1085.920: Explored 19580224 states 62954425 transitions, fanout: 3.215
pins2lts-mc-linux64( 0/ 8), 1085.921: Total exploration time 1050.240 sec (1049.820 sec minimum, 1049.909 sec on average)
pins2lts-mc-linux64( 0/ 8), 1085.921: States per second: 18644, Transitions per second: 59943
pins2lts-mc-linux64( 0/ 8), 1085.921:
pins2lts-mc-linux64( 0/ 8), 1085.921: State space has 25175845 states, 7835170 are accepting
pins2lts-mc-linux64( 0/ 8), 1085.921: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1085.921: blue states: 19580224 (77.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1085.921: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1085.921: all-red states: 7835170 (31.12%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1085.921:
pins2lts-mc-linux64( 0/ 8), 1085.921: Total memory used for local state coloring: 131.5MB
pins2lts-mc-linux64( 0/ 8), 1085.921:
pins2lts-mc-linux64( 0/ 8), 1085.921: Queue width: 8B, total height: 8619459, memory: 65.76MB
pins2lts-mc-linux64( 0/ 8), 1085.921: Tree memory: 448.1MB, 18.7 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1085.921: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1085.921: Stored 1464 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1085.921: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1085.921: Est. total memory use: 513.8MB (~1089.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5118500840089939934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S02J04T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-COL-S02J04T10, 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 r290-tajo-171654446300091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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