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.r266-smll-167863541100573.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 marciexred
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 r266-smll-167863541100573
=====================================================================

--------------------
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 1679154544833

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 15:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 15:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 15:49:08] [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-18 15:49:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 15:49:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1111 ms
[2023-03-18 15:49:09] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2023-03-18 15:49:09] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2023-03-18 15:49:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-18 15:49:09] [INFO ] Computed 1 place invariants in 5 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
[2023-03-18 15:49:09] [INFO ] Invariant cache hit.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-18 15:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 15:49:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 15:49:09] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-18 15:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-18 15:49:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 15:49:09] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-18 15:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-18 15:49:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 15:49:09] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-18 15:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 15:49:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 15:49:09] [INFO ] Added : 11 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 11 ms.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-18 15:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-18 15:49:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 15:49:10] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 15:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 15:49:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 15:49:10] [INFO ] Added : 12 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 15:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 15:49:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 15:49:10] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-18 15:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 15:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 15:49:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 15:49:10] [INFO ] Added : 12 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 10 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-18 15:49:10] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 64 ms.
[2023-03-18 15:49:10] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 13 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 8) seen :30
FORMULA Peterson-COL-4-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-03 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 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :4
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 :5
[2023-03-18 15:49:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 15:49:11] [INFO ] Computed 19 place invariants in 34 ms
[2023-03-18 15:49:11] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-18 15:49:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 15:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:11] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-18 15:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-18 15:49:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 15:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:12] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-18 15:49:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 15:49:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 66 ms returned sat
[2023-03-18 15:49:12] [INFO ] Deduced a trap composed of 14 places in 340 ms of which 13 ms to minimize.
[2023-03-18 15:49:13] [INFO ] Deduced a trap composed of 54 places in 358 ms of which 2 ms to minimize.
[2023-03-18 15:49:13] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2023-03-18 15:49:14] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 2 ms to minimize.
[2023-03-18 15:49:14] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 1 ms to minimize.
[2023-03-18 15:49:14] [INFO ] Deduced a trap composed of 47 places in 385 ms of which 2 ms to minimize.
[2023-03-18 15:49:15] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 1 ms to minimize.
[2023-03-18 15:49:15] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 2 ms to minimize.
[2023-03-18 15:49:16] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 1 ms to minimize.
[2023-03-18 15:49:16] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 2 ms to minimize.
[2023-03-18 15:49:16] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 1 ms to minimize.
[2023-03-18 15:49:16] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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-18 15:49:16] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-18 15:49:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 15:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:17] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-18 15:49:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-18 15:49:17] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 15:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:17] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-18 15:49:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 84 ms returned sat
[2023-03-18 15:49:18] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 2 ms to minimize.
[2023-03-18 15:49:18] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 1 ms to minimize.
[2023-03-18 15:49:19] [INFO ] Deduced a trap composed of 22 places in 372 ms of which 1 ms to minimize.
[2023-03-18 15:49:19] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 1 ms to minimize.
[2023-03-18 15:49:19] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 2 ms to minimize.
[2023-03-18 15:49:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1995 ms
[2023-03-18 15:49:19] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-18 15:49:19] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-18 15:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:20] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2023-03-18 15:49:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-18 15:49:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 15:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:20] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-18 15:49:20] [INFO ] [Nat]Added 116 Read/Feed constraints in 67 ms returned sat
[2023-03-18 15:49:21] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 1 ms to minimize.
[2023-03-18 15:49:21] [INFO ] Deduced a trap composed of 54 places in 359 ms of which 2 ms to minimize.
[2023-03-18 15:49:21] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2023-03-18 15:49:22] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-18 15:49:22] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 1 ms to minimize.
[2023-03-18 15:49:22] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 3 ms to minimize.
[2023-03-18 15:49:23] [INFO ] Deduced a trap composed of 72 places in 352 ms of which 2 ms to minimize.
[2023-03-18 15:49:23] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 1 ms to minimize.
[2023-03-18 15:49:24] [INFO ] Deduced a trap composed of 76 places in 340 ms of which 1 ms to minimize.
[2023-03-18 15:49:24] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 1 ms to minimize.
[2023-03-18 15:49:24] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2023-03-18 15:49:25] [INFO ] Deduced a trap composed of 54 places in 365 ms of which 1 ms to minimize.
[2023-03-18 15:49: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 REACHABILITY 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 2 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 9 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 151 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. 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-18 15:49:25] [INFO ] Computed 19 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 2) seen :2
[2023-03-18 15:49:28] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2023-03-18 15:49:28] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 15:49:28] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 15:49:28] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 15:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:28] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-18 15:49:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 15:49:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-18 15:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:29] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-18 15:49:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 15:49:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 28 ms returned sat
[2023-03-18 15:49:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:49:29] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-18 15:49:29] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:49:29] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:49:29] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 4 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:49:30] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2023-03-18 15:49:31] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:49:32] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:49:33] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2023-03-18 15:49:33] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-18 15:49:34] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:49:35] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-18 15:49:36] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2023-03-18 15:49:37] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:49:37] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:49:37] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:49:37] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-18 15:49:38] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-18 15:49:38] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-18 15:49:38] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-18 15:49:38] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2023-03-18 15:49:38] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:49:39] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-18 15:49:39] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-18 15:49:39] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-03-18 15:49:39] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:49:40] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-18 15:49:40] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-03-18 15:49:40] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2023-03-18 15:49:40] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-03-18 15:49:42] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:49:43] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:49:43] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:49:43] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:49:43] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-18 15:49:43] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2023-03-18 15:49:44] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:49:45] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-18 15:49:47] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-18 15:49:49] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:49:49] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-18 15:49:49] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:49:50] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2023-03-18 15:49:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-18 15:49:50] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:49:50] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2023-03-18 15:49:50] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:49:51] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2023-03-18 15:49:52] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-18 15:49:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:49:52] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-18 15:49:52] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2023-03-18 15:49:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:49:53] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:49:55] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-18 15:49:58] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 29323 ms
[2023-03-18 15:49:58] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 15:49:58] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-18 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:58] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-18 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:49:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 15:49:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-18 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:49:58] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-18 15:49:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 27 ms returned sat
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-18 15:49:59] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:50:00] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:50:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:50:02] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-18 15:50:03] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-18 15:50:03] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2023-03-18 15:50:04] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2023-03-18 15:50:05] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2023-03-18 15:50:06] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:50:07] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:50:07] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:50:07] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:08] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-18 15:50:08] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:08] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:50:08] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:50:08] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2023-03-18 15:50:09] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-18 15:50:09] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:50:09] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-18 15:50:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:10] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-18 15:50:10] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 0 ms to minimize.
[2023-03-18 15:50:10] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2023-03-18 15:50:12] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2023-03-18 15:50:13] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2023-03-18 15:50:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-18 15:50:17] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-03-18 15:50:19] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2023-03-18 15:50:19] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:19] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-03-18 15:50:20] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-18 15:50:20] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:50:20] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2023-03-18 15:50:20] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:50:20] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:50:21] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-18 15:50:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-18 15:50:22] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-03-18 15:50:22] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-18 15:50:22] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:50:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2023-03-18 15:50:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:50:24] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2023-03-18 15:50:27] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 29027 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 21 ms. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-18 15:50:28] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2023-03-18 15:50:28] [INFO ] Invariant cache hit.
[2023-03-18 15:50:28] [INFO ] Implicit Places using invariants in 280 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 284 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 22 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 320 ms. 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-18 15:50:28] [INFO ] Computed 14 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1801 ms. (steps per millisecond=555 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 2) seen :2
[2023-03-18 15:50:31] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-18 15:50:31] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 15:50:31] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 15:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:50:31] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-18 15:50:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:50:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 15:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:50:31] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-18 15:50:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 15:50:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 27 ms returned sat
[2023-03-18 15:50:31] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:31] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-18 15:50:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-03-18 15:50:32] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2023-03-18 15:50:33] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:50:34] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-18 15:50:35] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:50:35] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:50:35] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2023-03-18 15:50:35] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2023-03-18 15:50:35] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 4 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:50:36] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:50:37] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:50:38] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-18 15:50:39] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-18 15:50:40] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:41] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2023-03-18 15:50:42] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-03-18 15:50:42] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-18 15:50:42] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-18 15:50:42] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:50:43] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 3 ms to minimize.
[2023-03-18 15:50:43] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-18 15:50:43] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:50:44] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-18 15:50:44] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-03-18 15:50:44] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:50:44] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-18 15:50:44] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-18 15:50:45] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-18 15:50:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-18 15:50:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-18 15:50:45] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:50:46] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2023-03-18 15:50:46] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:50:46] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2023-03-18 15:50:46] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-18 15:50:46] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-18 15:50:47] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2023-03-18 15:50:47] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:50:47] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-18 15:50:47] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-18 15:50:47] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2023-03-18 15:50:48] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:50:48] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-18 15:50:49] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-18 15:50:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-18 15:50:52] [INFO ] Trap strengthening (SAT) tested/added 107/107 trap constraints in 21249 ms
[2023-03-18 15:50:52] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 15:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:50:53] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-18 15:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:50:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 15:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:50:53] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-18 15:50:53] [INFO ] [Nat]Added 116 Read/Feed constraints in 20 ms returned sat
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2023-03-18 15:50:54] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-18 15:50:55] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-18 15:50:56] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:50:57] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:50:57] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:50:57] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-18 15:50:57] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2023-03-18 15:50:57] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:50:58] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:50:59] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:51:00] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-18 15:51:01] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2023-03-18 15:51:02] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-18 15:51:03] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-18 15:51:04] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2023-03-18 15:51:05] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-18 15:51:06] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-18 15:51:06] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-18 15:51:06] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-18 15:51:06] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-18 15:51:06] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-18 15:51:07] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-18 15:51:07] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:51:07] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-03-18 15:51:08] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-18 15:51:08] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-03-18 15:51:08] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:51:08] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-03-18 15:51:08] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-03-18 15:51:09] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-18 15:51:09] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:51:09] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-18 15:51:09] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2023-03-18 15:51:10] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-18 15:51:10] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-18 15:51:10] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-03-18 15:51:10] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-18 15:51:11] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-18 15:51:11] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2023-03-18 15:51:12] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-18 15:51:12] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-18 15:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 107 trap constraints in 22405 ms
Current structural bounds on expressions (after SMT) : [5, 1] Max seen :[1, 1]
FORMULA Peterson-COL-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. 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-18 15:51:15] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 1) seen :1
[2023-03-18 15:51:18] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2023-03-18 15:51:18] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 15:51:18] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 15:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 15:51:18] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-18 15:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 15:51:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 15:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 15:51:18] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-18 15:51:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 15:51:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 27 ms returned sat
[2023-03-18 15:51:18] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:51:18] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:51:18] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-18 15:51:18] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-18 15:51:19] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-18 15:51:20] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-18 15:51:21] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2023-03-18 15:51:22] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-18 15:51:23] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-18 15:51:24] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-03-18 15:51:25] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-18 15:51:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-18 15:51:27] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2023-03-18 15:51:28] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-18 15:51:29] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-03-18 15:51:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:51:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 0 ms to minimize.
[2023-03-18 15:51:30] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-18 15:51:31] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-18 15:51:31] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-18 15:51:31] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-03-18 15:51:32] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2023-03-18 15:51:33] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:51:33] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:51:33] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2023-03-18 15:51:33] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:51:34] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-18 15:51:34] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:51:34] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-18 15:51:35] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-18 15:51:35] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-18 15:51:36] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-03-18 15:51:36] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-18 15:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 107 trap constraints in 21255 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA Peterson-COL-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 151850 ms.
ITS solved all properties within timeout

BK_STOP 1679154700775

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="marciexred"
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 marciexred"
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 r266-smll-167863541100573"
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 ;