Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027000220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
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 r179-tall-165277027000220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 21K Apr 29 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 29 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 29 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 862K May 10 09:34 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 1652833291001

Running Version 0
[2022-05-18 00:21:32] [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]
[2022-05-18 00:21:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:21:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2022-05-18 00:21:32] [INFO ] Transformed 476 places.
[2022-05-18 00:21:32] [INFO ] Transformed 920 transitions.
[2022-05-18 00:21:32] [INFO ] Parsed PT model containing 476 places and 920 transitions in 229 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
[2022-05-18 00:21:32] [INFO ] Computed 46 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :37
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :30
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :32
[2022-05-18 00:21:33] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2022-05-18 00:21:33] [INFO ] Computed 46 place invariants in 24 ms
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 20 ms returned unsat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:21:33] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 27 ms returned sat
[2022-05-18 00:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:34] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2022-05-18 00:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:21:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:34] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned sat
[2022-05-18 00:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:36] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2022-05-18 00:21:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:21:37] [INFO ] [Nat]Added 78 Read/Feed constraints in 417 ms returned sat
[2022-05-18 00:21:37] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 3 ms to minimize.
[2022-05-18 00:21:37] [INFO ] Deduced a trap composed of 107 places in 214 ms of which 2 ms to minimize.
[2022-05-18 00:21:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 673 ms
[2022-05-18 00:21:37] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-05-18 00:21:37] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:38] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-05-18 00:21:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:21:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2022-05-18 00:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:40] [INFO ] [Nat]Absence check using state equation in 1519 ms returned sat
[2022-05-18 00:21:40] [INFO ] [Nat]Added 78 Read/Feed constraints in 502 ms returned sat
[2022-05-18 00:21:40] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 51 ms.
[2022-05-18 00:21:43] [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 7
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.refineWithCausalOrder(DeadlockTester.java:858)
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)
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 23 ms returned unsat
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 5, 1, 2, 10, -1, 10, 1, 1] Max seen :[1, 1, 1, 5, 1, 2, 10, 1, 10, 1, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 5 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
Support contains 1 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 2 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 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 302 place count 324 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 314 place count 324 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 326 place count 312 transition count 662
Applied a total of 326 rules in 153 ms. Remains 312 /476 variables (removed 164) and now considering 662/824 (removed 162) transitions.
[2022-05-18 00:21:44] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 312 cols
[2022-05-18 00:21:44] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-18 00:21:44] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned [558, 559, 560, 562, 564, 565, 566, 568, 569, 570, 571, 576, 577, 579, 581, 582, 583, 584, 585, 586, 587, 589, 599, 600, 601, 602, 603, 605, 606, 607, 609, 610, 611, 612, 613, 614, 615, 618, 619, 620, 621, 622, 623, 624, 631, 632, 633, 634, 635, 636, 638, 640, 641, 642, 643, 644, 646, 647, 648, 649, 650, 651, 653, 655, 656, 657]
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions :[657, 656, 655, 653, 651, 650, 649, 648, 647, 646, 644, 643, 642, 641, 640, 638, 636, 635, 634, 633, 632, 631, 624, 623, 622, 621, 620, 619, 618, 615, 614, 613, 612, 611, 610, 609, 607, 606, 605, 603, 602, 601, 600, 599, 589, 587, 586, 585, 584, 583, 582, 581, 579, 577, 576, 571, 570, 569, 568, 566, 565, 564, 562, 560, 559, 558]
Starting structural reductions, iteration 1 : 312/476 places, 596/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 310 transition count 584
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 298 transition count 572
Applied a total of 14 rules in 34 ms. Remains 298 /312 variables (removed 14) and now considering 572/596 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 298/476 places, 572/824 transitions.
Normalized transition count is 560 out of 572 initially.
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 00:21:44] [INFO ] Computed 44 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 597 resets, run finished after 2999 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 1398 ms. (steps per millisecond=715 ) properties (out of 1) seen :1
[2022-05-18 00:21:48] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 00:21:48] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 00:21:49] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:49] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-18 00:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:49] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-05-18 00:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:21:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 00:21:49] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-18 00:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:21:49] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2022-05-18 00:21:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:21:49] [INFO ] [Nat]Added 78 Read/Feed constraints in 102 ms returned sat
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 2 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 1 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:21:50] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 0 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 0 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 1 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:21:51] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 10 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:21:52] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 0 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 144 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 1 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:21:53] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 6 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 1 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:21:54] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 0 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 0 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2022-05-18 00:21:55] [INFO ] Deduced a trap composed of 134 places in 95 ms of which 0 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 1 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 0 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 139 places in 102 ms of which 1 ms to minimize.
[2022-05-18 00:21:56] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 0 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 0 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 0 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 9 ms to minimize.
[2022-05-18 00:21:57] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 1 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 0 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:21:58] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 0 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 0 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:21:59] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:00] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2022-05-18 00:22:00] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2022-05-18 00:22:00] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:00] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:22:00] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 1 ms to minimize.
[2022-05-18 00:22:01] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2022-05-18 00:22:01] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:01] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:22:01] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 0 ms to minimize.
[2022-05-18 00:22:01] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2022-05-18 00:22:02] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:22:02] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 12887 ms
[2022-05-18 00:22:02] [INFO ] Computed and/alt/rep : 336/1492/330 causal constraints (skipped 228 transitions) in 34 ms.
[2022-05-18 00:22:04] [INFO ] Added : 195 causal constraints over 39 iterations in 2228 ms. Result :sat
Minimization took 2015 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 173200 steps, including 1000 resets, run finished after 526 ms. (steps per millisecond=329 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 298/298 places, 572/572 transitions.
Applied a total of 0 rules in 15 ms. Remains 298 /298 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 298/298 places, 572/572 transitions.
Starting structural reductions, iteration 0 : 298/298 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 298 /298 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2022-05-18 00:22:07] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 00:22:07] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-18 00:22:07] [INFO ] Implicit Places using invariants in 286 ms returned [74, 148, 168, 170, 263, 272]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 289 ms to find 6 implicit places.
[2022-05-18 00:22:07] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-18 00:22:07] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 292 cols
[2022-05-18 00:22:07] [INFO ] Computed 38 place invariants in 13 ms
[2022-05-18 00:22:08] [INFO ] Dead Transitions using invariants and state equation in 324 ms returned []
Starting structural reductions, iteration 1 : 292/298 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 289 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 289 transition count 569
Applied a total of 6 rules in 21 ms. Remains 289 /292 variables (removed 3) and now considering 569/572 (removed 3) transitions.
[2022-05-18 00:22:08] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:08] [INFO ] Computed 38 place invariants in 13 ms
[2022-05-18 00:22:08] [INFO ] Implicit Places using invariants in 266 ms returned []
[2022-05-18 00:22:08] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:08] [INFO ] Computed 38 place invariants in 8 ms
[2022-05-18 00:22:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:22:11] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 289/298 places, 569/572 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:11] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 612 resets, run finished after 2833 ms. (steps per millisecond=352 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 7 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :1
[2022-05-18 00:22:16] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:16] [INFO ] Computed 38 place invariants in 17 ms
[2022-05-18 00:22:16] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-18 00:22:16] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-18 00:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:16] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-05-18 00:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:22:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 00:22:16] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-18 00:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:17] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2022-05-18 00:22:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:22:17] [INFO ] [Nat]Added 78 Read/Feed constraints in 45 ms returned sat
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 1 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:19] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2022-05-18 00:22:20] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 141 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:22:21] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 1 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 1 ms to minimize.
[2022-05-18 00:22:22] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 0 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 1 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 0 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:22:23] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 0 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:24] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:25] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 8295 ms
[2022-05-18 00:22:25] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 44 ms.
[2022-05-18 00:22:28] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2022-05-18 00:22:28] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2022-05-18 00:22:28] [INFO ] Added : 264 causal constraints over 53 iterations in 3177 ms. Result :sat
Minimization took 778 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 119800 steps, including 1000 resets, run finished after 385 ms. (steps per millisecond=311 ) 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 14 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 12 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 00:22:30] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:30] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-18 00:22:30] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-05-18 00:22:30] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:30] [INFO ] Computed 38 place invariants in 8 ms
[2022-05-18 00:22:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:22:34] [INFO ] Implicit Places using invariants and state equation in 4261 ms returned []
Implicit Place search using SMT with State Equation took 4544 ms to find 0 implicit places.
[2022-05-18 00:22:34] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 00:22:34] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:34] [INFO ] Computed 38 place invariants in 11 ms
[2022-05-18 00:22:34] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-08
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:34] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
[2022-05-18 00:22:35] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:35] [INFO ] Computed 38 place invariants in 14 ms
[2022-05-18 00:22:35] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 00:22:35] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 12 ms returned sat
[2022-05-18 00:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:35] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-05-18 00:22:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:22:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 00:22:35] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-18 00:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:36] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-05-18 00:22:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:22:36] [INFO ] [Nat]Added 78 Read/Feed constraints in 45 ms returned sat
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 36 places in 19 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 0 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 121 places in 102 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 0 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 141 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:22:40] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:40] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 0 ms to minimize.
[2022-05-18 00:22:40] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:40] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2022-05-18 00:22:40] [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) : [-1] Max seen :[1]
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 13 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 00:22:40] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:40] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-18 00:22:40] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:40] [INFO ] Computed 38 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 606 resets, run finished after 2822 ms. (steps per millisecond=354 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 9 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 1) seen :1
[2022-05-18 00:22:44] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:44] [INFO ] Computed 38 place invariants in 16 ms
[2022-05-18 00:22:44] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-18 00:22:45] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-18 00:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:45] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-18 00:22:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:22:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 00:22:45] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-18 00:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:45] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-05-18 00:22:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:22:46] [INFO ] [Nat]Added 78 Read/Feed constraints in 45 ms returned sat
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 0 ms to minimize.
[2022-05-18 00:22:46] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 121 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:47] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 0 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:48] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 0 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 141 places in 99 ms of which 0 ms to minimize.
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 0 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 0 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 0 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 1 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:51] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:52] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 0 ms to minimize.
[2022-05-18 00:22:53] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 7732 ms
[2022-05-18 00:22:53] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 30 ms.
[2022-05-18 00:22:56] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 1 ms to minimize.
[2022-05-18 00:22:56] [INFO ] Deduced a trap composed of 132 places in 103 ms of which 0 ms to minimize.
[2022-05-18 00:22:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2022-05-18 00:22:56] [INFO ] Added : 264 causal constraints over 53 iterations in 3146 ms. Result :sat
Minimization took 758 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 119800 steps, including 1000 resets, run finished after 359 ms. (steps per millisecond=333 ) 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 11 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 11 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 00:22:58] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:58] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-18 00:22:58] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-18 00:22:58] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:22:58] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-18 00:22:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:23:02] [INFO ] Implicit Places using invariants and state equation in 3847 ms returned []
Implicit Place search using SMT with State Equation took 4088 ms to find 0 implicit places.
[2022-05-18 00:23:02] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 00:23:02] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 00:23:02] [INFO ] Computed 38 place invariants in 13 ms
[2022-05-18 00:23:02] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-08 in 27507 ms.
[2022-05-18 00:23:02] [INFO ] Flatten gal took : 118 ms
[2022-05-18 00:23:02] [INFO ] Applying decomposition
[2022-05-18 00:23:02] [INFO ] Flatten gal took : 47 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/graph7013221700975286378.txt, -o, /tmp/graph7013221700975286378.bin, -w, /tmp/graph7013221700975286378.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/graph7013221700975286378.bin, -l, -1, -v, -w, /tmp/graph7013221700975286378.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:23:03] [INFO ] Decomposing Gal with order
[2022-05-18 00:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:23:03] [INFO ] Removed a total of 550 redundant transitions.
[2022-05-18 00:23:03] [INFO ] Flatten gal took : 151 ms
[2022-05-18 00:23:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 20 ms.
[2022-05-18 00:23:03] [INFO ] Time to serialize gal into /tmp/UpperBounds979352284040512276.gal : 71 ms
[2022-05-18 00:23:03] [INFO ] Time to serialize properties into /tmp/UpperBounds11377219566661668591.prop : 1 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/UpperBounds979352284040512276.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11377219566661668591.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/UpperBounds979352284040512276.gal -t CGAL -reachable-file /tmp/UpperBounds11377219566661668591.prop --nowitness
Loading property file /tmp/UpperBounds11377219566661668591.prop.
Detected timeout of ITS tools.
[2022-05-18 00:43:33] [INFO ] Flatten gal took : 50 ms
[2022-05-18 00:43:33] [INFO ] Time to serialize gal into /tmp/UpperBounds10486255450995523786.gal : 38 ms
[2022-05-18 00:43:33] [INFO ] Time to serialize properties into /tmp/UpperBounds6394964671537531114.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/UpperBounds10486255450995523786.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6394964671537531114.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/UpperBounds10486255450995523786.gal -t CGAL -reachable-file /tmp/UpperBounds6394964671537531114.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6394964671537531114.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,7.42283e+06,55.3891,1215884,2,73571,5,1.98817e+06,6,0,1737,2.60002e+06,0
Total reachable state count : 7422828

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T06-UpperBounds-08 :0 <= AwakeTasks_3 <= 1
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 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-08,0,55.4038,1215884,1,0,7,1.98817e+06,9,1,2049,2.60002e+06,4

BK_STOP 1652834673214

--------------------
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="gold2021"
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 gold2021"
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 r179-tall-165277027000220"
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 ;