Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Peterson-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678918384932

Running Version 202205111006
[2023-03-15 22:13:07] [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]
[2023-03-15 22:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:13:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 22:13:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 22:13:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1505 ms
[2023-03-15 22:13:09] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2023-03-15 22:13:09] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 11 ms.
[2023-03-15 22:13:09] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:13:09] [INFO ] Computed 1 place invariants in 9 ms
FORMULA Peterson-COL-4-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:13:09] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-15 22:13:09] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-15 22:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:09] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-15 22:13:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-15 22:13:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 22:13:09] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-15 22:13:10] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:13:10] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:13:10] [INFO ] Added : 11 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 22:13:10] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:13:10] [INFO ] Added : 12 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 10 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:13:10] [INFO ] Added : 11 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:13:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:13:10] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5]
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 22:13:11] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 64 ms.
[2023-03-15 22:13:11] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :26
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :20
FORMULA Peterson-COL-4-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :5
[2023-03-15 22:13:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 22:13:11] [INFO ] Computed 19 place invariants in 37 ms
[2023-03-15 22:13:11] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-15 22:13:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-15 22:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:12] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-15 22:13:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-15 22:13:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 59 ms returned sat
[2023-03-15 22:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:12] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-15 22:13:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:13:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 74 ms returned sat
[2023-03-15 22:13:13] [INFO ] Deduced a trap composed of 43 places in 338 ms of which 10 ms to minimize.
[2023-03-15 22:13:13] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 3 ms to minimize.
[2023-03-15 22:13:13] [INFO ] Deduced a trap composed of 65 places in 321 ms of which 2 ms to minimize.
[2023-03-15 22:13:14] [INFO ] Deduced a trap composed of 36 places in 423 ms of which 2 ms to minimize.
[2023-03-15 22:13:14] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 2 ms to minimize.
[2023-03-15 22:13:15] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 1 ms to minimize.
[2023-03-15 22:13:15] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:13:15] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:13:16] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 1 ms to minimize.
[2023-03-15 22:13:16] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2023-03-15 22:13:17] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2023-03-15 22:13:17] [INFO ] Deduced a trap composed of 2 places in 475 ms of which 1 ms to minimize.
[2023-03-15 22:13:17] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:13:17] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-15 22:13:17] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-15 22:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:18] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2023-03-15 22:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-15 22:13:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-15 22:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:18] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-15 22:13:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 61 ms returned sat
[2023-03-15 22:13:19] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 2 ms to minimize.
[2023-03-15 22:13:19] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2023-03-15 22:13:19] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 1 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1693 ms
[2023-03-15 22:13:20] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 22:13:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-15 22:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:20] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-15 22:13:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-15 22:13:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-15 22:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:21] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-15 22:13:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 45 ms returned sat
[2023-03-15 22:13:21] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 1 ms to minimize.
[2023-03-15 22:13:21] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:13:22] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 0 ms to minimize.
[2023-03-15 22:13:22] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2023-03-15 22:13:22] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2023-03-15 22:13:22] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 0 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Deduced a trap composed of 76 places in 324 ms of which 2 ms to minimize.
[2023-03-15 22:13:24] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:13:24] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [INFO ] Deduced a trap composed of 40 places in 365 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [INFO ] Deduced a trap composed of 54 places in 361 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [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 2
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5, 4, 5] Max seen :[1, 4, 1]
FORMULA Peterson-COL-4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 4 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 153 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/480 places, 375/690 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 165 cols
[2023-03-15 22:13:26] [INFO ] Computed 19 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2361 ms. (steps per millisecond=423 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 2) seen :2
[2023-03-15 22:13:29] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2023-03-15 22:13:29] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 22:13:30] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 22:13:30] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 22:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:30] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-15 22:13:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:13:30] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 22:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:30] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-15 22:13:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:13:30] [INFO ] [Nat]Added 116 Read/Feed constraints in 29 ms returned sat
[2023-03-15 22:13:30] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:13:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:13:30] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:13:30] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 9 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 2 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 5 ms to minimize.
[2023-03-15 22:13:35] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 4 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:13:36] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 4 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2023-03-15 22:13:52] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:13:53] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:13:53] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:13:54] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:13:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2023-03-15 22:13:59] [INFO ] Trap strengthening (SAT) tested/added 104/104 trap constraints in 29105 ms
[2023-03-15 22:13:59] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:13:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 22:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:59] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-15 22:13:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 22:13:59] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 22:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:59] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-15 22:13:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2023-03-15 22:13:59] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2023-03-15 22:13:59] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:13:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:14:08] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:14:14] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:14] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-15 22:14:14] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:14:15] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:14:16] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:14:18] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:14:18] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-15 22:14:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:14:19] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:14:19] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2023-03-15 22:14:20] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:14:21] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2023-03-15 22:14:21] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:14:21] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:14:23] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:14:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2023-03-15 22:14:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:14:27] [INFO ] Trap strengthening (SAT) tested/added 104/104 trap constraints in 28168 ms
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 1]
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 21 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 15 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-15 22:14:27] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2023-03-15 22:14:27] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 22:14:28] [INFO ] Implicit Places using invariants in 157 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 159 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/165 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:14:28] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 2) seen :2
[2023-03-15 22:14:31] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:14:31] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 22:14:31] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 22:14:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:31] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-15 22:14:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:14:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:31] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-15 22:14:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:14:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:14:33] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:14:34] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:14:41] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:14:41] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:14:47] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-03-15 22:14:48] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:14:51] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 20351 ms
[2023-03-15 22:14:51] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:51] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-15 22:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:51] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-15 22:14:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:15:03] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:15:07] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-15 22:15:07] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2023-03-15 22:15:07] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-15 22:15:09] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:15:12] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 20589 ms
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-15 22:15:12] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:12] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-15 22:15:12] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-15 22:15:12] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:12] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:15:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:13] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-15 22:15:13] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-15 22:15:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:13] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:15:13] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting property specific reduction for Peterson-COL-4-UpperBounds-12
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:13] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
[2023-03-15 22:15:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:13] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 22:15:14] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 22:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:14] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-15 22:15:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 22:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:14] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-15 22:15:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 26 ms returned sat
[2023-03-15 22:15:14] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:15:14] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:15:14] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:14] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:15:15] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:15:16] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 0 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:15:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:19] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2023-03-15 22:15:19] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-15 22:15:19] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 0 ms to minimize.
[2023-03-15 22:15:19] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 19 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:19] [INFO ] Computed 14 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 1) seen :1
[2023-03-15 22:15:21] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:21] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:15:21] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:21] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-15 22:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 22:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:22] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-15 22:15:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:22] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:22] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:15:23] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 0 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:15:39] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-15 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 20816 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-15 22:15:42] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:42] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 22:15:43] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-15 22:15:43] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:43] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:15:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:43] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-15 22:15:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 22:15:43] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:43] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 22:15:44] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-COL-4-UpperBounds-12 in 30271 ms.
Starting property specific reduction for Peterson-COL-4-UpperBounds-14
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:44] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2023-03-15 22:15:44] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:44] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:15:44] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 22:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:44] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-15 22:15:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 22:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-15 22:15:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 30 ms returned sat
[2023-03-15 22:15:44] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:15:44] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:15:49] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:49] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1774 ms. (steps per millisecond=563 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 1) seen :1
[2023-03-15 22:15:51] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:15:51] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 22:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 22:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:51] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-15 22:15:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 22:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:52] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-15 22:15:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:15:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-15 22:16:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:16:12] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 20104 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-15 22:16:12] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:16:12] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-15 22:16:12] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-15 22:16:12] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:16:12] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:16:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 22:16:13] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-15 22:16:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:16:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-15 22:16:13] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:16:13] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-COL-4-UpperBounds-14 in 29311 ms.
[2023-03-15 22:16:13] [INFO ] Flatten gal took : 141 ms
[2023-03-15 22:16:13] [INFO ] Applying decomposition
[2023-03-15 22:16:13] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3330380583141668462.txt' '-o' '/tmp/graph3330380583141668462.bin' '-w' '/tmp/graph3330380583141668462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3330380583141668462.bin' '-l' '-1' '-v' '-w' '/tmp/graph3330380583141668462.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:16:14] [INFO ] Decomposing Gal with order
[2023-03-15 22:16:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:16:14] [INFO ] Removed a total of 411 redundant transitions.
[2023-03-15 22:16:14] [INFO ] Flatten gal took : 115 ms
[2023-03-15 22:16:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 27 ms.
[2023-03-15 22:16:14] [INFO ] Time to serialize gal into /tmp/UpperBounds6572431613326304246.gal : 13 ms
[2023-03-15 22:16:14] [INFO ] Time to serialize properties into /tmp/UpperBounds14061908313485239622.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6572431613326304246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14061908313485239622.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds14061908313485239622.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,4.2132e+06,127.45,2272956,2,162228,5,7.24337e+06,6,0,1152,9.59564e+06,0
Total reachable state count : 4213200

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-COL-4-UpperBounds-12 :0 <= gi6.gi0.gu18.CS_0+gi3.gu11.CS_1+gi6.gi0.gu22.CS_2+gi6.gi1.gu23.CS_3+gi6.gi0.gu17.CS_4 <= 1
FORMULA Peterson-COL-4-UpperBounds-12 1 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-COL-4-UpperBounds-12,0,127.477,2272956,1,0,7,7.24337e+06,9,1,1437,9.59564e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-COL-4-UpperBounds-14 :0 <= gi6.gi0.gu18.CS_0+gi3.gu11.CS_1+gi6.gi0.gu22.CS_2+gi6.gi1.gu23.CS_3+gi6.gi0.gu17.CS_4 <= 1
FORMULA Peterson-COL-4-UpperBounds-14 1 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-COL-4-UpperBounds-14,0,127.493,2272956,1,0,7,7.24337e+06,9,1,1437,9.59564e+06,4
Total runtime 314744 ms.

BK_STOP 1678918702347

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-COL-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Peterson-COL-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 r287-smll-167863553800072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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