Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268000219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268000219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 246K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 418K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 27 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 27 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 25 11:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 862K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621195119440

Running Version 0
[2021-05-16 19:58:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 19:58:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:58:41] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-16 19:58:41] [INFO ] Transformed 476 places.
[2021-05-16 19:58:41] [INFO ] Transformed 920 transitions.
[2021-05-16 19:58:41] [INFO ] Parsed PT model containing 476 places and 920 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 812 out of 824 initially.
// Phase 1: matrix 812 rows 476 cols
[2021-05-16 19:58:41] [INFO ] Computed 46 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :18
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :16
[2021-05-16 19:58:42] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2021-05-16 19:58:42] [INFO ] Computed 46 place invariants in 69 ms
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 31 ms returned unsat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2021-05-16 19:58:42] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 10 ms returned unsat
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned sat
[2021-05-16 19:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:58:43] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2021-05-16 19:58:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:58:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 12 ms returned unsat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:58:44] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2021-05-16 19:58:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:58:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned sat
[2021-05-16 19:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:58:46] [INFO ] [Nat]Absence check using state equation in 1391 ms returned sat
[2021-05-16 19:58:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 19:58:46] [INFO ] [Nat]Added 78 Read/Feed constraints in 313 ms returned sat
[2021-05-16 19:58:46] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 121 ms.
[2021-05-16 19:58:50] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 17 ms to minimize.
[2021-05-16 19:58:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned sat
[2021-05-16 19:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-16 19:58:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:58:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 19:58:50] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned sat
[2021-05-16 19:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:58:51] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2021-05-16 19:58:51] [INFO ] [Nat]Added 78 Read/Feed constraints in 349 ms returned sat
[2021-05-16 19:58:52] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
[2021-05-16 19:58:52] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 1 ms to minimize.
[2021-05-16 19:58:52] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2021-05-16 19:58:53] [INFO ] Deduced a trap composed of 215 places in 236 ms of which 1 ms to minimize.
[2021-05-16 19:58:53] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 0 ms to minimize.
[2021-05-16 19:58:53] [INFO ] Deduced a trap composed of 66 places in 38 ms of which 0 ms to minimize.
[2021-05-16 19:58:53] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 3 ms to minimize.
[2021-05-16 19:58:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2095 ms
[2021-05-16 19:58:54] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 48 ms.
[2021-05-16 19:58:55] [INFO ] Added : 80 causal constraints over 16 iterations in 1548 ms. Result :unknown
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 12 ms returned unsat
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 10 ms returned unsat
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 19:58:55] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 33 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 2, 1, 6, 1, 6, 1, 1, 2] Max seen :[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 167400 steps, including 1002 resets, run finished after 420 ms. (steps per millisecond=398 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 9 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 298 place count 326 transition count 676
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 310 place count 326 transition count 664
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 322 place count 314 transition count 664
Applied a total of 322 rules in 190 ms. Remains 314 /476 variables (removed 162) and now considering 664/824 (removed 160) transitions.
[2021-05-16 19:58:56] [INFO ] Flow matrix only has 652 transitions (discarded 12 similar events)
// Phase 1: matrix 652 rows 314 cols
[2021-05-16 19:58:56] [INFO ] Computed 44 place invariants in 25 ms
[2021-05-16 19:58:57] [INFO ] Dead Transitions using invariants and state equation in 639 ms returned [560, 561, 562, 564, 566, 567, 568, 570, 571, 572, 573, 578, 579, 581, 583, 584, 585, 586, 587, 588, 589, 591, 601, 602, 603, 604, 605, 607, 608, 609, 611, 612, 613, 614, 615, 616, 617, 620, 621, 622, 623, 624, 625, 626, 633, 634, 635, 636, 637, 638, 640, 642, 643, 644, 645, 646, 648, 649, 650, 651, 652, 653, 655, 657, 658, 659]
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions :[659, 658, 657, 655, 653, 652, 651, 650, 649, 648, 646, 645, 644, 643, 642, 640, 638, 637, 636, 635, 634, 633, 626, 625, 624, 623, 622, 621, 620, 617, 616, 615, 614, 613, 612, 611, 609, 608, 607, 605, 604, 603, 602, 601, 591, 589, 588, 587, 586, 585, 584, 583, 581, 579, 578, 573, 572, 571, 570, 568, 567, 566, 564, 562, 561, 560]
Starting structural reductions, iteration 1 : 314/476 places, 598/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 586
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 300 transition count 574
Applied a total of 14 rules in 29 ms. Remains 300 /314 variables (removed 14) and now considering 574/598 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 300/476 places, 574/824 transitions.
Normalized transition count is 562 out of 574 initially.
// Phase 1: matrix 562 rows 300 cols
[2021-05-16 19:58:57] [INFO ] Computed 44 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 583 resets, run finished after 2626 ms. (steps per millisecond=380 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 302 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 305 resets, run finished after 1253 ms. (steps per millisecond=798 ) properties (out of 2) seen :2
[2021-05-16 19:59:02] [INFO ] Flow matrix only has 562 transitions (discarded 12 similar events)
// Phase 1: matrix 562 rows 300 cols
[2021-05-16 19:59:02] [INFO ] Computed 44 place invariants in 8 ms
[2021-05-16 19:59:02] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-16 19:59:02] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 8 ms returned sat
[2021-05-16 19:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:02] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-16 19:59:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:59:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-16 19:59:02] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 19 ms returned sat
[2021-05-16 19:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:03] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2021-05-16 19:59:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 19:59:03] [INFO ] [Nat]Added 78 Read/Feed constraints in 21 ms returned sat
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 0 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:03] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 1 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 0 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 1 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 142 places in 92 ms of which 1 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 1 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 0 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:04] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:05] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 0 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 4 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:06] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 0 ms to minimize.
[2021-05-16 19:59:07] [INFO ] Deduced a trap composed of 130 places in 71 ms of which 0 ms to minimize.
[2021-05-16 19:59:08] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 0 ms to minimize.
[2021-05-16 19:59:08] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 0 ms to minimize.
[2021-05-16 19:59:08] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 5033 ms
[2021-05-16 19:59:08] [INFO ] Computed and/alt/rep : 338/1494/332 causal constraints (skipped 228 transitions) in 24 ms.
[2021-05-16 19:59:10] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:10] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2021-05-16 19:59:10] [INFO ] Deduced a trap composed of 37 places in 19 ms of which 0 ms to minimize.
[2021-05-16 19:59:10] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:10] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 0 ms to minimize.
[2021-05-16 19:59:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 686 ms
[2021-05-16 19:59:10] [INFO ] Added : 216 causal constraints over 44 iterations in 2760 ms. Result :sat
Minimization took 460 ms.
[2021-05-16 19:59:11] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-16 19:59:11] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 19:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:11] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-16 19:59:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:59:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-16 19:59:11] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 14 ms returned sat
[2021-05-16 19:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:12] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2021-05-16 19:59:12] [INFO ] [Nat]Added 78 Read/Feed constraints in 60 ms returned sat
[2021-05-16 19:59:12] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2021-05-16 19:59:12] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2021-05-16 19:59:12] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 7 ms to minimize.
[2021-05-16 19:59:12] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 37 places in 20 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 36 places in 18 ms of which 0 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2021-05-16 19:59:13] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 2 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 121 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 132 places in 91 ms of which 0 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 1 ms to minimize.
[2021-05-16 19:59:14] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 1 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 0 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 1 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2021-05-16 19:59:15] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 37 places in 22 ms of which 0 ms to minimize.
[2021-05-16 19:59:16] [INFO ] Deduced a trap composed of 118 places in 105 ms of which 0 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 0 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 1 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 0 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Deduced a trap composed of 146 places in 93 ms of which 1 ms to minimize.
[2021-05-16 19:59:17] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 5455 ms
[2021-05-16 19:59:17] [INFO ] Computed and/alt/rep : 338/1494/332 causal constraints (skipped 228 transitions) in 25 ms.
[2021-05-16 19:59:20] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 1 ms to minimize.
[2021-05-16 19:59:20] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 0 ms to minimize.
[2021-05-16 19:59:20] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 1 ms to minimize.
[2021-05-16 19:59:20] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:20] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:21] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 0 ms to minimize.
[2021-05-16 19:59:21] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 0 ms to minimize.
[2021-05-16 19:59:21] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 1 ms to minimize.
[2021-05-16 19:59:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1569 ms
[2021-05-16 19:59:21] [INFO ] Added : 246 causal constraints over 50 iterations in 3690 ms. Result :sat
Minimization took 625 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 1]
Incomplete Parikh walk after 93200 steps, including 1000 resets, run finished after 265 ms. (steps per millisecond=351 ) properties (out of 2) seen :2 could not realise parikh vector
Incomplete Parikh walk after 59300 steps, including 1000 resets, run finished after 141 ms. (steps per millisecond=420 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 574/574 transitions.
Starting structural reductions, iteration 0 : 300/300 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2021-05-16 19:59:22] [INFO ] Flow matrix only has 562 transitions (discarded 12 similar events)
// Phase 1: matrix 562 rows 300 cols
[2021-05-16 19:59:22] [INFO ] Computed 44 place invariants in 5 ms
[2021-05-16 19:59:22] [INFO ] Implicit Places using invariants in 266 ms returned [75, 150, 170, 172, 265, 274]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 279 ms to find 6 implicit places.
[2021-05-16 19:59:23] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-16 19:59:23] [INFO ] Flow matrix only has 562 transitions (discarded 12 similar events)
// Phase 1: matrix 562 rows 294 cols
[2021-05-16 19:59:23] [INFO ] Computed 38 place invariants in 18 ms
[2021-05-16 19:59:23] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned []
Starting structural reductions, iteration 1 : 294/300 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 290 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 290 transition count 570
Applied a total of 8 rules in 27 ms. Remains 290 /294 variables (removed 4) and now considering 570/574 (removed 4) transitions.
[2021-05-16 19:59:23] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 19:59:23] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 19:59:23] [INFO ] Implicit Places using invariants in 414 ms returned []
[2021-05-16 19:59:23] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 19:59:23] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 19:59:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 19:59:26] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3342 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 290/300 places, 570/574 transitions.
Normalized transition count is 558 out of 570 initially.
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 19:59:26] [INFO ] Computed 38 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 592 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 279 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 303 resets, run finished after 1124 ms. (steps per millisecond=889 ) properties (out of 2) seen :2
[2021-05-16 19:59:31] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 19:59:31] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 19:59:31] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 19:59:31] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-16 19:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:31] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-16 19:59:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:59:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-16 19:59:31] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 8 ms returned sat
[2021-05-16 19:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:31] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2021-05-16 19:59:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 19:59:31] [INFO ] [Nat]Added 78 Read/Feed constraints in 54 ms returned sat
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 1 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 135 places in 73 ms of which 1 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 121 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 0 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 0 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2021-05-16 19:59:32] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 0 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 0 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 1 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 0 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:33] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 1 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 1 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2021-05-16 19:59:34] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 36 places in 18 ms of which 0 ms to minimize.
[2021-05-16 19:59:35] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 1 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 0 ms to minimize.
[2021-05-16 19:59:36] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 0 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 0 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 0 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:37] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 0 ms to minimize.
[2021-05-16 19:59:38] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 0 ms to minimize.
[2021-05-16 19:59:39] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 133 places in 87 ms of which 1 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:40] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 0 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 112 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 1 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 0 ms to minimize.
[2021-05-16 19:59:41] [INFO ] Deduced a trap composed of 142 places in 68 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 0 ms to minimize.
[2021-05-16 19:59:42] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 0 ms to minimize.
[2021-05-16 19:59:43] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 0 ms to minimize.
[2021-05-16 19:59:43] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2021-05-16 19:59:43] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 0 ms to minimize.
[2021-05-16 19:59:43] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 0 ms to minimize.
[2021-05-16 19:59:43] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 11553 ms
[2021-05-16 19:59:43] [INFO ] Computed and/alt/rep : 334/1489/328 causal constraints (skipped 228 transitions) in 52 ms.
[2021-05-16 19:59:46] [INFO ] Added : 239 causal constraints over 49 iterations in 2686 ms. Result :sat
Minimization took 470 ms.
[2021-05-16 19:59:46] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 19:59:46] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-16 19:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:46] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-16 19:59:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 19:59:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 19:59:47] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-16 19:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 19:59:47] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-16 19:59:47] [INFO ] [Nat]Added 78 Read/Feed constraints in 114 ms returned sat
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 0 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 37 places in 20 ms of which 0 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 36 places in 22 ms of which 0 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2021-05-16 19:59:47] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 0 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 1 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 1 ms to minimize.
[2021-05-16 19:59:48] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:49] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 1 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 126 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 1 ms to minimize.
[2021-05-16 19:59:50] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 1 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 132 places in 88 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 0 ms to minimize.
[2021-05-16 19:59:51] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:52] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 0 ms to minimize.
[2021-05-16 19:59:53] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2021-05-16 19:59:54] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 0 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 0 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 3 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2021-05-16 19:59:55] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 123 places in 96 ms of which 0 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 149 places in 97 ms of which 0 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 0 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 1 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 1 ms to minimize.
[2021-05-16 19:59:56] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 9406 ms
[2021-05-16 19:59:56] [INFO ] Computed and/alt/rep : 334/1489/328 causal constraints (skipped 228 transitions) in 22 ms.
[2021-05-16 19:59:58] [INFO ] Added : 163 causal constraints over 33 iterations in 1696 ms. Result :sat
Minimization took 495 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 1]
Incomplete Parikh walk after 52600 steps, including 1000 resets, run finished after 130 ms. (steps per millisecond=404 ) properties (out of 2) seen :2 could not realise parikh vector
Incomplete Parikh walk after 209700 steps, including 1000 resets, run finished after 502 ms. (steps per millisecond=417 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 570/570 transitions.
Starting structural reductions, iteration 0 : 290/290 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2021-05-16 19:59:59] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 19:59:59] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:00] [INFO ] Implicit Places using invariants in 375 ms returned []
[2021-05-16 20:00:00] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:00] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:03] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 3494 ms to find 0 implicit places.
[2021-05-16 20:00:03] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-16 20:00:03] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:03] [INFO ] Computed 38 place invariants in 7 ms
[2021-05-16 20:00:03] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 570/570 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-09
Normalized transition count is 558 out of 570 initially.
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:03] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
[2021-05-16 20:00:03] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:03] [INFO ] Computed 38 place invariants in 12 ms
[2021-05-16 20:00:03] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 20:00:03] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-16 20:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:03] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-16 20:00:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:00:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-16 20:00:03] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-16 20:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:04] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2021-05-16 20:00:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:04] [INFO ] [Nat]Added 78 Read/Feed constraints in 53 ms returned sat
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 137 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 121 places in 88 ms of which 0 ms to minimize.
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 0 ms to minimize.
[2021-05-16 20:00:04] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 0 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:05] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 0 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 125 places in 94 ms of which 0 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 0 ms to minimize.
[2021-05-16 20:00:06] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:07] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 0 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2021-05-16 20:00:08] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2021-05-16 20:00:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 570/570 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 289 transition count 569
Applied a total of 2 rules in 14 ms. Remains 289 /290 variables (removed 1) and now considering 569/570 (removed 1) transitions.
[2021-05-16 20:00:08] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:08] [INFO ] Computed 38 place invariants in 6 ms
[2021-05-16 20:00:09] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/290 places, 569/570 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:09] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 570 resets, run finished after 2212 ms. (steps per millisecond=452 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 271 resets, run finished after 1124 ms. (steps per millisecond=889 ) properties (out of 1) seen :1
[2021-05-16 20:00:12] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:12] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:12] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 20:00:12] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-16 20:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:12] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-16 20:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:00:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 20:00:12] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-16 20:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:13] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2021-05-16 20:00:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:13] [INFO ] [Nat]Added 78 Read/Feed constraints in 72 ms returned sat
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 36 places in 17 ms of which 1 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 37 places in 15 ms of which 0 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 0 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 0 ms to minimize.
[2021-05-16 20:00:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 510 ms
[2021-05-16 20:00:13] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 21 ms.
[2021-05-16 20:00:15] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 0 ms to minimize.
[2021-05-16 20:00:15] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:15] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:15] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 0 ms to minimize.
[2021-05-16 20:00:15] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 1 ms to minimize.
[2021-05-16 20:00:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 670 ms
[2021-05-16 20:00:15] [INFO ] Added : 151 causal constraints over 31 iterations in 2023 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 69100 steps, including 1000 resets, run finished after 157 ms. (steps per millisecond=440 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2021-05-16 20:00:16] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:16] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:16] [INFO ] Implicit Places using invariants in 209 ms returned []
[2021-05-16 20:00:16] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:16] [INFO ] Computed 38 place invariants in 6 ms
[2021-05-16 20:00:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:20] [INFO ] Implicit Places using invariants and state equation in 3613 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
[2021-05-16 20:00:20] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-16 20:00:20] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:20] [INFO ] Computed 38 place invariants in 13 ms
[2021-05-16 20:00:20] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-09 in 17356 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-11
Normalized transition count is 558 out of 570 initially.
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:20] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
[2021-05-16 20:00:20] [INFO ] Flow matrix only has 558 transitions (discarded 12 similar events)
// Phase 1: matrix 558 rows 290 cols
[2021-05-16 20:00:20] [INFO ] Computed 38 place invariants in 11 ms
[2021-05-16 20:00:20] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 20:00:20] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-16 20:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:21] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-16 20:00:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:00:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-16 20:00:21] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-16 20:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:21] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-16 20:00:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:21] [INFO ] [Nat]Added 78 Read/Feed constraints in 110 ms returned sat
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 0 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 37 places in 21 ms of which 0 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 1 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 36 places in 15 ms of which 0 ms to minimize.
[2021-05-16 20:00:21] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 1 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:22] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 0 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 0 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 0 ms to minimize.
[2021-05-16 20:00:23] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2021-05-16 20:00:24] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 132 places in 83 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 0 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2021-05-16 20:00:25] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2021-05-16 20:00:26] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2021-05-16 20:00:26] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 0 ms to minimize.
[2021-05-16 20:00:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 570/570 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 289 transition count 569
Applied a total of 2 rules in 16 ms. Remains 289 /290 variables (removed 1) and now considering 569/570 (removed 1) transitions.
[2021-05-16 20:00:26] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:26] [INFO ] Computed 38 place invariants in 10 ms
[2021-05-16 20:00:26] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/290 places, 569/570 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:26] [INFO ] Computed 38 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 566 resets, run finished after 2254 ms. (steps per millisecond=443 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 299 resets, run finished after 1158 ms. (steps per millisecond=863 ) properties (out of 1) seen :1
[2021-05-16 20:00:30] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:30] [INFO ] Computed 38 place invariants in 12 ms
[2021-05-16 20:00:30] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-16 20:00:30] [INFO ] [Real]Absence check using 17 positive and 21 generalized place invariants in 6 ms returned sat
[2021-05-16 20:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:30] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-16 20:00:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:00:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-16 20:00:30] [INFO ] [Nat]Absence check using 17 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-16 20:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:00:30] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2021-05-16 20:00:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:30] [INFO ] [Nat]Added 78 Read/Feed constraints in 68 ms returned sat
[2021-05-16 20:00:30] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 1 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 0 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 1 ms to minimize.
[2021-05-16 20:00:31] [INFO ] Deduced a trap composed of 125 places in 78 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 108 places in 96 ms of which 0 ms to minimize.
[2021-05-16 20:00:32] [INFO ] Deduced a trap composed of 118 places in 76 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 129 places in 80 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 110 places in 78 ms of which 1 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 0 ms to minimize.
[2021-05-16 20:00:33] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2021-05-16 20:00:34] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2021-05-16 20:00:34] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:34] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3686 ms
[2021-05-16 20:00:34] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 27 ms.
[2021-05-16 20:00:36] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:37] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 0 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 0 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 0 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 122 places in 83 ms of which 1 ms to minimize.
[2021-05-16 20:00:38] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 0 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 0 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 0 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 0 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 0 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 133 places in 101 ms of which 1 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2021-05-16 20:00:39] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2021-05-16 20:00:40] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 0 ms to minimize.
[2021-05-16 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3267 ms
[2021-05-16 20:00:40] [INFO ] Added : 246 causal constraints over 50 iterations in 5758 ms. Result :sat
Minimization took 490 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 126000 steps, including 1000 resets, run finished after 301 ms. (steps per millisecond=418 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2021-05-16 20:00:41] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:41] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:41] [INFO ] Implicit Places using invariants in 220 ms returned []
[2021-05-16 20:00:41] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:41] [INFO ] Computed 38 place invariants in 5 ms
[2021-05-16 20:00:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-16 20:00:44] [INFO ] Implicit Places using invariants and state equation in 3304 ms returned []
Implicit Place search using SMT with State Equation took 3541 ms to find 0 implicit places.
[2021-05-16 20:00:44] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-16 20:00:44] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2021-05-16 20:00:44] [INFO ] Computed 38 place invariants in 11 ms
[2021-05-16 20:00:44] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-11 in 24078 ms.
[2021-05-16 20:00:45] [INFO ] Flatten gal took : 137 ms
[2021-05-16 20:00:45] [INFO ] Applying decomposition
[2021-05-16 20:00:45] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16327892188369800776.txt, -o, /tmp/graph16327892188369800776.bin, -w, /tmp/graph16327892188369800776.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16327892188369800776.bin, -l, -1, -v, -w, /tmp/graph16327892188369800776.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 20:00:45] [INFO ] Decomposing Gal with order
[2021-05-16 20:00:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:00:45] [INFO ] Removed a total of 642 redundant transitions.
[2021-05-16 20:00:45] [INFO ] Flatten gal took : 98 ms
[2021-05-16 20:00:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 18 ms.
[2021-05-16 20:00:45] [INFO ] Time to serialize gal into /tmp/UpperBounds14617617680464889683.gal : 10 ms
[2021-05-16 20:00:45] [INFO ] Time to serialize properties into /tmp/UpperBounds14318525549000143722.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14617617680464889683.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14318525549000143722.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14617617680464889683.gal -t CGAL -reachable-file /tmp/UpperBounds14318525549000143722.prop --nowitness
Loading property file /tmp/UpperBounds14318525549000143722.prop.
Detected timeout of ITS tools.
[2021-05-16 20:21:26] [INFO ] Flatten gal took : 46 ms
[2021-05-16 20:21:26] [INFO ] Time to serialize gal into /tmp/UpperBounds16905028323465971328.gal : 5 ms
[2021-05-16 20:21:26] [INFO ] Time to serialize properties into /tmp/UpperBounds10714068674807394979.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16905028323465971328.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10714068674807394979.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16905028323465971328.gal -t CGAL -reachable-file /tmp/UpperBounds10714068674807394979.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds10714068674807394979.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.53733e+06,71.7917,1200716,2,77907,5,1.89217e+06,6,0,1742,2.37219e+06,0
Total reachable state count : 5537328

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T06-UpperBounds-09 :0 <= IdleTasks_2 <= 1
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J04T06-UpperBounds-09,0,71.7986,1200716,1,0,7,1.89217e+06,9,1,2059,2.37219e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T06-UpperBounds-11 :0 <= IdleTasks_4 <= 1
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J04T06-UpperBounds-11,0,71.8035,1200716,1,0,8,1.89217e+06,10,1,2080,2.37219e+06,5
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621196559104

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-PT-S02J04T06"
export BK_EXAMINATION="UpperBounds"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;