MCC'2021- Execution of r140-tall-162089128200619

About the Execution of ITS-Tools for Peterson-PT-4

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3292.855	388529.00	256657.00	42501.20	5 1 5 5 4 5 5 5 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 520K 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 Peterson-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621019909152

Running Version 0
[2021-05-14 19:18:30] [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-14 19:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:18:30] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-14 19:18:30] [INFO ] Transformed 480 places.
[2021-05-14 19:18:30] [INFO ] Transformed 690 transitions.
[2021-05-14 19:18:30] [INFO ] Found NUPN structural information;
[2021-05-14 19:18:30] [INFO ] Parsed PT model containing 480 places and 690 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7118 ms.
FORMULA Peterson-PT-4-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 19:18:37] [INFO ] Computed 19 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :29
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :18
[2021-05-14 19:18:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 19:18:38] [INFO ] Computed 19 place invariants in 21 ms
[2021-05-14 19:18:38] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned unsat
[2021-05-14 19:18:38] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:18:38] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:38] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-14 19:18:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:18:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:18:38] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 19:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:39] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-14 19:18:39] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:18:39] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 19:18:39] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 4 ms to minimize.
[2021-05-14 19:18:39] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2021-05-14 19:18:39] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2021-05-14 19:18:39] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:18:39] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:18:40] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2021-05-14 19:18:41] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:18:42] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 4 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:18:43] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:18: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 1
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: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-14 19:18:51] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2021-05-14 19:18:51] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2021-05-14 19:18:51] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:18:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:51] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-14 19:18:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:18:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2021-05-14 19:18:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:51] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-14 19:18:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 19:18:51] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 0 ms to minimize.
[2021-05-14 19:18:51] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 0 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 1 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 0 ms to minimize.
[2021-05-14 19:18:52] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:18:53] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 0 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 7 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:18:54] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 9 ms to minimize.
[2021-05-14 19:18:55] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4264 ms
[2021-05-14 19:18:55] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2021-05-14 19:18:56] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2021-05-14 19:18:56] [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 4
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-14 19:18:56] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2021-05-14 19:18:56] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:18:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:56] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-14 19:18:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:18:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:18:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:18:57] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-14 19:18:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:18:57] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 1 ms to minimize.
[2021-05-14 19:18:57] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2021-05-14 19:18:57] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2021-05-14 19:18:57] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 1 ms to minimize.
[2021-05-14 19:18:57] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 0 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2021-05-14 19:18:58] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:18:59] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:19:00] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:19:00] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2021-05-14 19:19:00] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2021-05-14 19:19:00] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 1 ms to minimize.
[2021-05-14 19:19:00] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3152 ms
[2021-05-14 19:19:00] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 36 ms.
[2021-05-14 19:19:01] [INFO ] Added : 255 causal constraints over 51 iterations in 1619 ms. Result :unknown
[2021-05-14 19:19:02] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:19:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:02] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-14 19:19:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:19:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:19:02] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:02] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-14 19:19:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:19:02] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2021-05-14 19:19:02] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2021-05-14 19:19:02] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:19:02] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2021-05-14 19:19:03] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 140 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:19:04] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:19:05] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 1 ms to minimize.
[2021-05-14 19:19:05] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:19:05] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2996 ms
[2021-05-14 19:19:05] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2021-05-14 19:19:07] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 1 ms to minimize.
[2021-05-14 19:19:07] [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.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)
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 100, 5, 1, 1] Max seen :[5, 1, 5, 5, 3, 5, 0, 0]
FORMULA Peterson-PT-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 187500 steps, including 1000 resets, run finished after 586 ms. (steps per millisecond=319 ) properties (out of 4) seen :6 could not realise parikh vector
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 105 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 320 place count 320 transition count 495
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 390 place count 285 transition count 495
Applied a total of 390 rules in 57 ms. Remains 285 /480 variables (removed 195) and now considering 495/690 (removed 195) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/480 places, 495/690 transitions.
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 19:19:07] [INFO ] Computed 19 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3144 ms. (steps per millisecond=318 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 2) seen :2
[2021-05-14 19:19:13] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 19:19:13] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-14 19:19:13] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:19:13] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:13] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-14 19:19:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:19:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:19:13] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:13] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-14 19:19:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:19:13] [INFO ] [Nat]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 19:19:13] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:19:13] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:19:13] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:19:14] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:19:15] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2021-05-14 19:19:16] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:19:17] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:19:18] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:19:18] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:19:18] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:19:58] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:19:58] [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: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-14 19:19:58] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:19:58] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:58] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-14 19:19:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:19:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:19:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:19:58] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-14 19:19:58] [INFO ] [Nat]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:19:59] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:20:00] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1768 ms
[2021-05-14 19:20:00] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 28 ms.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:20:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 514 ms
[2021-05-14 19:20:03] [INFO ] Added : 388 causal constraints over 78 iterations in 2274 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [5, 100] Max seen :[1, 4]
Incomplete Parikh walk after 28800 steps, including 673 resets, run finished after 100 ms. (steps per millisecond=288 ) properties (out of 2) seen :3 could not realise parikh vector
Support contains 105 out of 285 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 285/285 places, 495/495 transitions.
Applied a total of 0 rules in 18 ms. Remains 285 /285 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 495/495 transitions.
Starting structural reductions, iteration 0 : 285/285 places, 495/495 transitions.
Applied a total of 0 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2021-05-14 19:20:03] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 19:20:03] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-14 19:20:03] [INFO ] Implicit Places using invariants in 128 ms returned [272, 273, 274, 275, 276]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 130 ms to find 5 implicit places.
[2021-05-14 19:20:03] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-14 19:20:03] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:20:03] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:20:03] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Starting structural reductions, iteration 1 : 280/285 places, 495/495 transitions.
Applied a total of 0 rules in 16 ms. Remains 280 /280 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2021-05-14 19:20:03] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 19:20:03] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:20:03] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:20:03] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Finished structural reductions, in 2 iterations. Remains : 280/285 places, 495/495 transitions.
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:20:03] [INFO ] Computed 14 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3088 ms. (steps per millisecond=323 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 2) seen :2
[2021-05-14 19:20:09] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:20:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:20:09] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:20:09] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-14 19:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:20:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:20:09] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-14 19:20:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:20:09] [INFO ] [Nat]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 19:20:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:20:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:20:09] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:20:10] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 2 ms to minimize.
[2021-05-14 19:20:11] [INFO ] Deduced a trap composed of 62 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 62 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 2 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:20:12] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:20:13] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:20:14] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:20:14] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:20:14] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:20:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:20:14] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:20:15] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:20:16] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:20:16] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:20:16] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:20:16] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:20:56] [INFO ] Deduced a trap composed of 2 places in 1919 ms of which 1 ms to minimize.
[2021-05-14 19:20:56] [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: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-14 19:20:56] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:20:56] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-14 19:20:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:20:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:20:56] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-14 19:20:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 19:20:56] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:20:56] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2021-05-14 19:20:57] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:20:58] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1927 ms
[2021-05-14 19:20:58] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 24 ms.
[2021-05-14 19:21:00] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:21:00] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:21:00] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2021-05-14 19:21:00] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:21:01] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:01] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:21:01] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:21:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 645 ms
[2021-05-14 19:21:01] [INFO ] Added : 391 causal constraints over 79 iterations in 2594 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : [5, 100] Max seen :[1, 4]
Incomplete Parikh walk after 37100 steps, including 862 resets, run finished after 132 ms. (steps per millisecond=281 ) properties (out of 2) seen :3 could not realise parikh vector
Support contains 105 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 495/495 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 495/495 transitions.
Starting structural reductions, iteration 0 : 280/280 places, 495/495 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2021-05-14 19:21:01] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:01] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:01] [INFO ] Implicit Places using invariants in 111 ms returned []
[2021-05-14 19:21:01] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:01] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:02] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2021-05-14 19:21:02] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 19:21:02] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:02] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:21:02] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 495/495 transitions.
Starting property specific reduction for Peterson-PT-4-UpperBounds-01
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:02] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2021-05-14 19:21:02] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:02] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:02] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:02] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-14 19:21:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:21:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:02] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-14 19:21:02] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 19:21:02] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:21:02] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:21:02] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:21:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:21:04] [INFO ] Deduced a trap composed of 62 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:05] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:21:06] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:21:07] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:21:07] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 6 ms to minimize.
[2021-05-14 19:21:07] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:21:07] [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) : [5] Max seen :[1]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 495/495 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 280 transition count 459
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 244 transition count 459
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 72 place count 244 transition count 395
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 200 place count 180 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 240 place count 160 transition count 375
Applied a total of 240 rules in 26 ms. Remains 160 /280 variables (removed 120) and now considering 375/495 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/280 places, 375/495 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2021-05-14 19:21:07] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2178 ms. (steps per millisecond=459 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 1) seen :1
[2021-05-14 19:21:10] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2021-05-14 19:21:10] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:10] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 19:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:10] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:21:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:21:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:10] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 19:21:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:10] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:21:10] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:21:12] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:21:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:13] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:21:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:21:13] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:21:13] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:21:15] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:21:15] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:21:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 59 trap constraints in 8248 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA Peterson-PT-4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-PT-4-UpperBounds-01 in 16462 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-05
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:18] [INFO ] Computed 14 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2021-05-14 19:21:18] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 19:21:18] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:18] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:19] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-14 19:21:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:21:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:19] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-14 19:21:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 16 ms returned sat
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2021-05-14 19:21:19] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:21:20] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2021-05-14 19:21:21] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:21:21] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:21] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1928 ms
[2021-05-14 19:21:21] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 21 ms.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:21:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 642 ms
[2021-05-14 19:21:23] [INFO ] Added : 391 causal constraints over 79 iterations in 2597 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [100] Max seen :[4]
Incomplete Parikh walk after 37100 steps, including 871 resets, run finished after 124 ms. (steps per millisecond=299 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 100 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 495/495 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 280 transition count 490
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 275 transition count 490
Applied a total of 10 rules in 15 ms. Remains 275 /280 variables (removed 5) and now considering 490/495 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 275/280 places, 490/495 transitions.
Normalized transition count is 430 out of 490 initially.
// Phase 1: matrix 430 rows 275 cols
[2021-05-14 19:21:24] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3030 ms. (steps per millisecond=330 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1612 ms. (steps per millisecond=620 ) properties (out of 1) seen :1
[2021-05-14 19:21:28] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2021-05-14 19:21:28] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:28] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-14 19:21:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:28] [INFO ] [Real]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-14 19:21:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:21:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 19:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:21:28] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-14 19:21:28] [INFO ] [Nat]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-14 19:21:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:21:30] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2021-05-14 19:21:31] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:21:31] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:21:31] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2102 ms
[2021-05-14 19:21:31] [INFO ] Computed and/alt/rep : 389/906/389 causal constraints (skipped 36 transitions) in 22 ms.
[2021-05-14 19:21:32] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:21:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 765 ms
[2021-05-14 19:21:33] [INFO ] Added : 377 causal constraints over 76 iterations in 2590 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : [100] Max seen :[4]
Incomplete Parikh walk after 43200 steps, including 998 resets, run finished after 138 ms. (steps per millisecond=313 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 100 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 275 /275 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 490/490 transitions.
Starting structural reductions, iteration 0 : 275/275 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 275 /275 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2021-05-14 19:21:34] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2021-05-14 19:21:34] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2021-05-14 19:21:34] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2021-05-14 19:21:34] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:21:34] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:21:34] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2021-05-14 19:21:34] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:21:34] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2021-05-14 19:21:34] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:21:34] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 490/490 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-05 in 15936 ms.
[2021-05-14 19:21:34] [INFO ] Flatten gal took : 68 ms
[2021-05-14 19:21:34] [INFO ] Applying decomposition
[2021-05-14 19:21:35] [INFO ] Flatten gal took : 28 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/graph13680929458531154667.txt, -o, /tmp/graph13680929458531154667.bin, -w, /tmp/graph13680929458531154667.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/graph13680929458531154667.bin, -l, -1, -v, -w, /tmp/graph13680929458531154667.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:21:35] [INFO ] Decomposing Gal with order
[2021-05-14 19:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:21:35] [INFO ] Removed a total of 526 redundant transitions.
[2021-05-14 19:21:35] [INFO ] Flatten gal took : 77 ms
[2021-05-14 19:21:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 21 ms.
[2021-05-14 19:21:35] [INFO ] Time to serialize gal into /tmp/UpperBounds12151278265167144838.gal : 8 ms
[2021-05-14 19:21:35] [INFO ] Time to serialize properties into /tmp/UpperBounds13689144547640612820.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/UpperBounds12151278265167144838.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13689144547640612820.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/UpperBounds12151278265167144838.gal -t CGAL -reachable-file /tmp/UpperBounds13689144547640612820.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds13689144547640612820.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\_mod\_flatf,3.23266e+07,190.063,2925192,2,269234,5,6.87068e+06,6,0,1660,1.10206e+07,0
Total reachable state count : 32326608

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Peterson-PT-4-UpperBounds-05 :0 <= gi2.gi1.gu52.IsEndLoop_0_0_0+gi0.gi0.gu0.IsEndLoop_1_0_0+gi2.gi1.gu1.IsEndLoop_2_0_0+gi2.gi0.gu2.IsEndLoop_3_0_0+gi8.gu63.IsEndLoop_4_0_0+gi7.gi0.gu3.IsEndLoop_0_1_0+gi7.gi2.gu97.IsEndLoop_1_1_0+gi5.gu4.IsEndLoop_2_1_0+gi6.gi0.gu62.IsEndLoop_3_1_0+gi8.gu5.IsEndLoop_4_1_0+gi10.gu6.IsEndLoop_0_2_0+gi9.gi0.gu7.IsEndLoop_1_2_0+gi3.gi1.gu73.IsEndLoop_2_2_0+gi9.gi3.gu74.IsEndLoop_4_2_0+gi9.gi3.gu8.IsEndLoop_3_2_0+gi4.gi1.gu96.IsEndLoop_1_3_0+gi4.gi0.gu56.IsEndLoop_0_3_0+gi1.gi1.gu9.IsEndLoop_3_3_0+gi3.gi2.gu10.IsEndLoop_2_3_0+gi2.gi2.gu11.IsEndLoop_0_0_1+gi4.gi0.gu12.IsEndLoop_4_3_0+gi1.gi2.gu13.IsEndLoop_2_0_1+gi0.gi0.gu75.IsEndLoop_1_0_1+gi8.gu77.IsEndLoop_4_0_1+gi2.gi0.gu14.IsEndLoop_3_0_1+gi7.gi2.gu76.IsEndLoop_1_1_1+gi7.gi0.gu15.IsEndLoop_0_1_1+gi6.gi0.gu16.IsEndLoop_3_1_1+gi5.gu17.IsEndLoop_2_1_1+gi9.gi0.gu18.IsEndLoop_1_2_1+gi3.gi0.gu19.IsEndLoop_2_2_1+gi8.gu65.IsEndLoop_4_1_1+gi10.gu64.IsEndLoop_0_2_1+gi4.gi2.gu67.IsEndLoop_0_3_1+gi4.gi1.gu66.IsEndLoop_1_3_1+gi9.gi3.gu20.IsEndLoop_3_2_1+gi9.gi3.gu21.IsEndLoop_4_2_1+gi4.gi0.gu22.IsEndLoop_4_3_1+gi2.gi2.gu69.IsEndLoop_0_0_2+gi3.gi2.gu100.IsEndLoop_2_3_1+gi1.gi1.gu23.IsEndLoop_3_3_1+gi2.gi0.gu99.IsEndLoop_3_0_2+gi8.gu24.IsEndLoop_4_0_2+gi0.gi1.gu25.IsEndLoop_1_0_2+gi1.gi2.gu68.IsEndLoop_2_0_2+gi6.gi1.gu98.IsEndLoop_3_1_2+gi5.gu70.IsEndLoop_2_1_2+gi7.gi1.gu71.IsEndLoop_1_1_2+gi7.gi0.gu72.IsEndLoop_0_1_2+gi3.gi0.gu26.IsEndLoop_2_2_2+gi9.gi3.gu84.IsEndLoop_1_2_2+gi10.gu27.IsEndLoop_0_2_2+gi8.gu83.IsEndLoop_4_1_2+gi4.gi1.gu86.IsEndLoop_1_3_2+gi4.gi2.gu28.IsEndLoop_0_3_2+gi9.gi1.gu85.IsEndLoop_4_2_2+gi9.gi2.gu29.IsEndLoop_3_2_2+gi2.gi2.gu30.IsEndLoop_0_0_3+gi4.gi0.gu87.IsEndLoop_4_3_2+gi1.gi0.gu31.IsEndLoop_3_3_2+gi3.gi2.gu32.IsEndLoop_2_3_2+gi7.gi0.gu90.IsEndLoop_0_1_3+gi7.gi1.gu33.IsEndLoop_1_1_3+gi5.gu34.IsEndLoop_2_1_3+gi6.gi1.gu78.IsEndLoop_3_1_3+gi0.gi1.gu88.IsEndLoop_1_0_3+gi2.gi1.gu89.IsEndLoop_2_0_3+gi2.gi0.gu35.IsEndLoop_3_0_3+gi8.gu102.IsEndLoop_4_0_3+gi9.gi2.gu36.IsEndLoop_3_2_3+gi9.gi1.gu37.IsEndLoop_4_2_3+gi4.gi2.gu38.IsEndLoop_0_3_3+gi4.gi0.gu39.IsEndLoop_1_3_3+gi9.gi3.gu103.IsEndLoop_4_1_3+gi10.gu40.IsEndLoop_0_2_3+gi9.gi3.gu41.IsEndLoop_1_2_3+gi3.gi1.gu79.IsEndLoop_2_2_3+gi2.gi1.gu81.IsEndLoop_2_0_4+gi2.gi1.gu49.IsEndLoop_1_0_4+gi8.gu102.IsEndLoop_4_0_4+gi2.gi1.gu48.IsEndLoop_3_0_4+gi1.gi0.gu42.IsEndLoop_3_3_3+gi3.gi2.gu43.IsEndLoop_2_3_3+gi2.gi1.gu80.IsEndLoop_0_0_4+gi4.gi0.gu101.IsEndLoop_4_3_3+gi10.gu93.IsEndLoop_0_2_4+gi9.gi3.gu103.IsEndLoop_4_1_4+gi3.gi1.gu51.IsEndLoop_2_2_4+gi9.gi3.gu92.IsEndLoop_1_2_4+gi7.gi0.gu47.IsEndLoop_1_1_4+gi7.gi0.gu46.IsEndLoop_0_1_4+gi7.gi0.gu45.IsEndLoop_3_1_4+gi7.gi0.gu44.IsEndLoop_2_1_4+gi4.gi0.gu101.IsEndLoop_4_3_4+gi3.gi2.gu55.IsEndLoop_2_3_4+gi4.gi0.gu54.IsEndLoop_3_3_4+gi4.gi0.gu94.IsEndLoop_0_3_4+gi4.gi0.gu95.IsEndLoop_1_3_4+gi9.gi3.gu50.IsEndLoop_3_2_4+gi9.gi1.gu37.IsEndLoop_4_2_4 <= 5
FORMULA Peterson-PT-4-UpperBounds-05 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-05,0,191.853,2925192,1,0,7,6.87068e+06,9,1,2603,1.10206e+07,4

BK_STOP 1621020297681

--------------------
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="Peterson-PT-4"
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 Peterson-PT-4, 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 r140-tall-162089128200619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 ;