Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500022.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ASLink-PT-04a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 436K May 10 09:33 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 ASLink-PT-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727396290

Running Version 0
[2022-05-16 18:56:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:56:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:38] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-16 18:56:38] [INFO ] Transformed 1016 places.
[2022-05-16 18:56:38] [INFO ] Transformed 1554 transitions.
[2022-05-16 18:56:38] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:38] [INFO ] Parsed PT model containing 1016 places and 1554 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
// Phase 1: matrix 1538 rows 1016 cols
[2022-05-16 18:56:38] [INFO ] Computed 194 place invariants in 122 ms
Incomplete random walk after 10000 steps, including 76 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :7
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :2
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
// Phase 1: matrix 1538 rows 1016 cols
[2022-05-16 18:56:38] [INFO ] Computed 194 place invariants in 53 ms
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 32 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-05-16 18:56:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:39] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 29 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:40] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2022-05-16 18:56:40] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 4 ms to minimize.
[2022-05-16 18:56:41] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2022-05-16 18:56:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
[2022-05-16 18:56:41] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 109 ms.
[2022-05-16 18:56:44] [INFO ] Added : 65 causal constraints over 13 iterations in 3657 ms. Result :unknown
[2022-05-16 18:56:45] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2022-05-16 18:56:45] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 43 ms returned sat
[2022-05-16 18:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:45] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2022-05-16 18:56:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2022-05-16 18:56:45] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 35 ms returned sat
[2022-05-16 18:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:50] [INFO ] [Nat]Absence check using state equation in 4786 ms returned unknown
[2022-05-16 18:56:51] [INFO ] [Real]Absence check using 46 positive place invariants in 38 ms returned sat
[2022-05-16 18:56:51] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 73 ms returned sat
[2022-05-16 18:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:51] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2022-05-16 18:56:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:52] [INFO ] [Nat]Absence check using 46 positive place invariants in 19 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 30 ms returned sat
[2022-05-16 18:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:52] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2022-05-16 18:56:53] [INFO ] Deduced a trap composed of 80 places in 368 ms of which 2 ms to minimize.
[2022-05-16 18:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2022-05-16 18:56:53] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 115 ms.
[2022-05-16 18:56:56] [INFO ] Added : 10 causal constraints over 2 iterations in 3661 ms. Result :unknown
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using 46 positive place invariants in 28 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 38 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-05-16 18:56:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:57] [INFO ] [Nat]Absence check using 46 positive place invariants in 20 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 34 ms returned sat
[2022-05-16 18:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:01] [INFO ] [Nat]Absence check using state equation in 3334 ms returned sat
[2022-05-16 18:57:01] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 2 ms to minimize.
[2022-05-16 18:57:01] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2022-05-16 18:57:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2022-05-16 18:57:02] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 147 ms.
[2022-05-16 18:57:02] [INFO ] Added : 15 causal constraints over 3 iterations in 711 ms. Result :unknown
[2022-05-16 18:57:02] [INFO ] [Real]Absence check using 46 positive place invariants in 18 ms returned sat
[2022-05-16 18:57:02] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 33 ms returned sat
[2022-05-16 18:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:03] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2022-05-16 18:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:03] [INFO ] [Nat]Absence check using 46 positive place invariants in 20 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 31 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:07] [INFO ] [Nat]Absence check using state equation in 3538 ms returned sat
[2022-05-16 18:57:07] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 0 ms to minimize.
[2022-05-16 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2022-05-16 18:57:07] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 118 ms.
[2022-05-16 18:57:09] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 2 ms to minimize.
[2022-05-16 18:57:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 71 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2022-05-16 18:57:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 25 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 44 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:11] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2022-05-16 18:57:11] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2022-05-16 18:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2022-05-16 18:57:11] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 129 ms.
[2022-05-16 18:57:14] [INFO ] Added : 5 causal constraints over 1 iterations in 3126 ms. Result :unknown
[2022-05-16 18:57:15] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2022-05-16 18:57:15] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 41 ms returned sat
[2022-05-16 18:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:15] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2022-05-16 18:57:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 33 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:20] [INFO ] [Nat]Absence check using state equation in 4791 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 105100 steps, including 1656 resets, run finished after 422 ms. (steps per millisecond=249 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 325300 steps, including 4187 resets, run finished after 1166 ms. (steps per millisecond=278 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 33900 steps, including 892 resets, run finished after 95 ms. (steps per millisecond=356 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 283900 steps, including 2708 resets, run finished after 815 ms. (steps per millisecond=348 ) properties (out of 7) seen :3 could not realise parikh vector
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 1016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 992 transition count 1450
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 200 place count 904 transition count 1450
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 200 place count 904 transition count 1361
Deduced a syphon composed of 89 places in 5 ms
Ensure Unique test removed 34 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 412 place count 781 transition count 1361
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 413 place count 781 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 780 transition count 1360
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 421 place count 773 transition count 1325
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 429 place count 772 transition count 1325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 435 place count 771 transition count 1320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 438 place count 768 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 439 place count 767 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 440 place count 767 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 441 place count 766 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 766 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 443 place count 765 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 444 place count 765 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 764 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 446 place count 764 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 447 place count 763 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 763 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 449 place count 762 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 762 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 761 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 761 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 453 place count 760 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 760 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 759 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 759 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 758 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 758 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 459 place count 757 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 460 place count 757 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 756 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 756 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 755 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 464 place count 755 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 465 place count 754 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 466 place count 754 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 467 place count 753 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 468 place count 753 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 469 place count 752 transition count 1192
Iterating global reduction 6 with 1 rules applied. Total rules applied 470 place count 752 transition count 1192
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 526 place count 724 transition count 1164
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 529 place count 724 transition count 1161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 532 place count 721 transition count 1161
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 537 place count 721 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 538 place count 720 transition count 1160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 546 place count 712 transition count 1160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 546 place count 712 transition count 1144
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 579 place count 695 transition count 1144
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 584 place count 690 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 584 place count 690 transition count 1143
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 586 place count 689 transition count 1143
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 596 place count 684 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 600 place count 680 transition count 1134
Iterating global reduction 9 with 4 rules applied. Total rules applied 604 place count 680 transition count 1134
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 608 place count 680 transition count 1130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 612 place count 676 transition count 1130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 616 place count 676 transition count 1130
Applied a total of 616 rules in 1182 ms. Remains 676 /1016 variables (removed 340) and now considering 1130/1538 (removed 408) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/1016 places, 1130/1538 transitions.
// Phase 1: matrix 1130 rows 676 cols
[2022-05-16 18:57:24] [INFO ] Computed 120 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 12827 resets, run finished after 2360 ms. (steps per millisecond=423 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2961 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2927 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2948 resets, run finished after 1209 ms. (steps per millisecond=827 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2990 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 4) seen :0
// Phase 1: matrix 1130 rows 676 cols
[2022-05-16 18:57:31] [INFO ] Computed 120 place invariants in 15 ms
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 21 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-16 18:57:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:32] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2022-05-16 18:57:32] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 93 ms.
[2022-05-16 18:57:37] [INFO ] Added : 288 causal constraints over 58 iterations in 5467 ms. Result :sat
Minimization took 360 ms.
[2022-05-16 18:57:38] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-16 18:57:38] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-16 18:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:38] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2022-05-16 18:57:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:38] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 24 ms returned sat
[2022-05-16 18:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:39] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2022-05-16 18:57:39] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 77 ms.
[2022-05-16 18:57:44] [INFO ] Added : 314 causal constraints over 63 iterations in 5219 ms. Result :sat
Minimization took 397 ms.
[2022-05-16 18:57:45] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-16 18:57:45] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-16 18:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:45] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-05-16 18:57:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 23 ms returned sat
[2022-05-16 18:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2022-05-16 18:57:46] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 78 ms.
[2022-05-16 18:57:51] [INFO ] Added : 299 causal constraints over 60 iterations in 5388 ms. Result :sat
Minimization took 437 ms.
[2022-05-16 18:57:52] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-16 18:57:52] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-16 18:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:52] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-05-16 18:57:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2022-05-16 18:57:53] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 27 ms returned sat
[2022-05-16 18:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:53] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2022-05-16 18:57:53] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 94 ms.
[2022-05-16 18:57:56] [INFO ] Added : 102 causal constraints over 21 iterations in 2220 ms. Result :sat
Minimization took 289 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 70800 steps, including 1671 resets, run finished after 187 ms. (steps per millisecond=378 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 125400 steps, including 2054 resets, run finished after 275 ms. (steps per millisecond=456 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 173700 steps, including 2495 resets, run finished after 402 ms. (steps per millisecond=432 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 169400 steps, including 2278 resets, run finished after 396 ms. (steps per millisecond=427 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 676 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 676/676 places, 1130/1130 transitions.
Applied a total of 0 rules in 49 ms. Remains 676 /676 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/676 places, 1130/1130 transitions.
Starting structural reductions, iteration 0 : 676/676 places, 1130/1130 transitions.
Applied a total of 0 rules in 55 ms. Remains 676 /676 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
// Phase 1: matrix 1130 rows 676 cols
[2022-05-16 18:57:57] [INFO ] Computed 120 place invariants in 34 ms
[2022-05-16 18:57:58] [INFO ] Implicit Places using invariants in 650 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 223, 257, 261, 262, 273, 274, 275, 293, 311, 380, 384, 385, 396, 397, 398, 416, 434, 503, 507, 508, 511, 522, 523, 524, 542, 544, 547, 565, 566, 567, 568, 580, 586, 592, 598, 604, 610, 616, 622, 628, 634, 640]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 656 ms to find 55 implicit places.
[2022-05-16 18:57:58] [INFO ] Redundant transitions in 135 ms returned []
// Phase 1: matrix 1130 rows 621 cols
[2022-05-16 18:57:58] [INFO ] Computed 65 place invariants in 10 ms
[2022-05-16 18:57:59] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Starting structural reductions, iteration 1 : 621/676 places, 1130/1130 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 621 transition count 1041
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 532 transition count 1041
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 178 place count 532 transition count 1018
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 225 place count 508 transition count 1018
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 237 place count 504 transition count 1010
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 245 place count 496 transition count 1010
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 260 place count 481 transition count 995
Iterating global reduction 4 with 15 rules applied. Total rules applied 275 place count 481 transition count 995
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 278 place count 481 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 278 place count 481 transition count 991
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 480 transition count 991
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 283 place count 477 transition count 988
Iterating global reduction 5 with 3 rules applied. Total rules applied 286 place count 477 transition count 988
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 287 place count 476 transition count 987
Iterating global reduction 5 with 1 rules applied. Total rules applied 288 place count 476 transition count 987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 289 place count 475 transition count 986
Iterating global reduction 5 with 1 rules applied. Total rules applied 290 place count 475 transition count 986
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 366 place count 437 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 369 place count 437 transition count 945
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 373 place count 433 transition count 941
Iterating global reduction 6 with 4 rules applied. Total rules applied 377 place count 433 transition count 941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 380 place count 433 transition count 938
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 382 place count 433 transition count 936
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 391 place count 433 transition count 927
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 401 place count 423 transition count 927
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 414 place count 423 transition count 927
Applied a total of 414 rules in 183 ms. Remains 423 /621 variables (removed 198) and now considering 927/1130 (removed 203) transitions.
// Phase 1: matrix 927 rows 423 cols
[2022-05-16 18:57:59] [INFO ] Computed 59 place invariants in 11 ms
[2022-05-16 18:57:59] [INFO ] Implicit Places using invariants in 229 ms returned [72, 89, 95, 98, 100, 104, 105, 157, 177, 183, 186, 188, 193, 194, 246, 263, 269, 272, 274, 279, 280, 332, 349, 355, 358, 360]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 233 ms to find 26 implicit places.
Starting structural reductions, iteration 2 : 397/676 places, 927/1130 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 385 transition count 915
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 385 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 381 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 381 transition count 911
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 373 transition count 903
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 373 transition count 891
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 361 transition count 891
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 361 transition count 888
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 358 transition count 888
Applied a total of 78 rules in 92 ms. Remains 358 /397 variables (removed 39) and now considering 888/927 (removed 39) transitions.
// Phase 1: matrix 888 rows 358 cols
[2022-05-16 18:57:59] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-16 18:57:59] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 888 rows 358 cols
[2022-05-16 18:57:59] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-16 18:58:00] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 358/676 places, 888/1130 transitions.
Successfully produced net in file /tmp/petri1000_11437086585874158642.dot
Successfully produced net in file /tmp/petri1001_8497374537914908535.dot
Successfully produced net in file /tmp/petri1002_7185324211016607990.dot
Successfully produced net in file /tmp/petri1003_17736247227170945680.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 884 rows 358 cols
[2022-05-16 18:58:00] [INFO ] Computed 33 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 19459 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5809 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5770 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5814 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5728 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 4) seen :0
// Phase 1: matrix 884 rows 358 cols
[2022-05-16 18:58:04] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:58:04] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:04] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:05] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-16 18:58:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:05] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:05] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-05-16 18:58:05] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 48 ms.
[2022-05-16 18:58:06] [INFO ] Added : 42 causal constraints over 10 iterations in 601 ms. Result :sat
Minimization took 150 ms.
[2022-05-16 18:58:06] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:06] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 12 ms returned sat
[2022-05-16 18:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:06] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-05-16 18:58:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:06] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 5 ms returned sat
[2022-05-16 18:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:06] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2022-05-16 18:58:06] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 47 ms.
[2022-05-16 18:58:07] [INFO ] Added : 46 causal constraints over 10 iterations in 455 ms. Result :sat
Minimization took 187 ms.
[2022-05-16 18:58:07] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:07] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:07] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-16 18:58:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:07] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:08] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-16 18:58:08] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 48 ms.
[2022-05-16 18:58:08] [INFO ] Added : 38 causal constraints over 8 iterations in 371 ms. Result :sat
Minimization took 140 ms.
[2022-05-16 18:58:08] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:09] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-16 18:58:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:09] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 17 ms returned sat
[2022-05-16 18:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:09] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-16 18:58:09] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 65 ms.
[2022-05-16 18:58:09] [INFO ] Added : 32 causal constraints over 7 iterations in 426 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 42300 steps, including 1419 resets, run finished after 115 ms. (steps per millisecond=367 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 73000 steps, including 1427 resets, run finished after 157 ms. (steps per millisecond=464 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 72600 steps, including 2579 resets, run finished after 146 ms. (steps per millisecond=497 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57100 steps, including 1854 resets, run finished after 135 ms. (steps per millisecond=422 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 358/358 places, 884/884 transitions.
Graph (complete) has 2184 edges and 358 vertex of which 354 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 354 transition count 884
Applied a total of 5 rules in 43 ms. Remains 354 /358 variables (removed 4) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/358 places, 884/884 transitions.
// Phase 1: matrix 884 rows 354 cols
[2022-05-16 18:58:10] [INFO ] Computed 33 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 19385 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5781 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5708 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5764 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5794 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 4) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-16 18:58:15] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-16 18:58:15] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:15] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:15] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2022-05-16 18:58:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:15] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:16] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2022-05-16 18:58:16] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 45 ms.
[2022-05-16 18:58:16] [INFO ] Added : 36 causal constraints over 10 iterations in 539 ms. Result :sat
Minimization took 169 ms.
[2022-05-16 18:58:16] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:16] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:17] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-05-16 18:58:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:17] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:17] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-16 18:58:17] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 64 ms.
[2022-05-16 18:58:18] [INFO ] Added : 30 causal constraints over 7 iterations in 657 ms. Result :sat
Minimization took 214 ms.
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2022-05-16 18:58:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:19] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-05-16 18:58:19] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 12 ms to minimize.
[2022-05-16 18:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-16 18:58:19] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 57 ms.
[2022-05-16 18:58:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2022-05-16 18:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-16 18:58:20] [INFO ] Added : 43 causal constraints over 11 iterations in 725 ms. Result :sat
Minimization took 133 ms.
[2022-05-16 18:58:20] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-05-16 18:58:20] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 11 ms returned sat
[2022-05-16 18:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:20] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-05-16 18:58:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:20] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:21] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-16 18:58:21] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 48 ms.
[2022-05-16 18:58:21] [INFO ] Added : 19 causal constraints over 5 iterations in 349 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 65600 steps, including 2426 resets, run finished after 124 ms. (steps per millisecond=529 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 59000 steps, including 1811 resets, run finished after 95 ms. (steps per millisecond=621 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 55000 steps, including 2867 resets, run finished after 104 ms. (steps per millisecond=528 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 94200 steps, including 2280 resets, run finished after 168 ms. (steps per millisecond=560 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 884/884 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 354 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 353 transition count 883
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 352 transition count 882
Applied a total of 4 rules in 37 ms. Remains 352 /354 variables (removed 2) and now considering 882/884 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/354 places, 882/884 transitions.
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:22] [INFO ] Computed 33 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 19435 resets, run finished after 1626 ms. (steps per millisecond=615 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5784 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5825 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 2) seen :0
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:25] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 18:58:25] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:25] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 18:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:25] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-16 18:58:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:25] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:25] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-16 18:58:25] [INFO ] Computed and/alt/rep : 179/841/179 causal constraints (skipped 681 transitions) in 55 ms.
[2022-05-16 18:58:26] [INFO ] Added : 17 causal constraints over 4 iterations in 320 ms. Result :sat
Minimization took 120 ms.
[2022-05-16 18:58:26] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:26] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:26] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-16 18:58:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:26] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:26] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-16 18:58:26] [INFO ] Computed and/alt/rep : 179/841/179 causal constraints (skipped 681 transitions) in 47 ms.
[2022-05-16 18:58:27] [INFO ] Added : 22 causal constraints over 5 iterations in 321 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 44000 steps, including 1629 resets, run finished after 123 ms. (steps per millisecond=357 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 44500 steps, including 1744 resets, run finished after 90 ms. (steps per millisecond=494 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 882/882 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 882/882 transitions.
Starting structural reductions, iteration 0 : 352/352 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 882/882 (removed 0) transitions.
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:27] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:58:28] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:28] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-16 18:58:28] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2022-05-16 18:58:28] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:28] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-16 18:58:28] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 882/882 transitions.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-00
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:28] [INFO ] Computed 33 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 205 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:28] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:58:29] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:29] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:29] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-16 18:58:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:29] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:29] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-16 18:58:29] [INFO ] Computed and/alt/rep : 179/841/179 causal constraints (skipped 681 transitions) in 45 ms.
[2022-05-16 18:58:29] [INFO ] Added : 17 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 44500 steps, including 1747 resets, run finished after 69 ms. (steps per millisecond=644 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 882/882 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 351 transition count 881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 351 transition count 880
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 350 transition count 880
Applied a total of 4 rules in 15 ms. Remains 350 /352 variables (removed 2) and now considering 880/882 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/352 places, 880/882 transitions.
// Phase 1: matrix 880 rows 350 cols
[2022-05-16 18:58:30] [INFO ] Computed 33 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 19450 resets, run finished after 1683 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5803 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties (out of 1) seen :0
// Phase 1: matrix 880 rows 350 cols
[2022-05-16 18:58:32] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 18:58:32] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:32] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-16 18:58:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-05-16 18:58:33] [INFO ] Computed and/alt/rep : 177/839/177 causal constraints (skipped 681 transitions) in 43 ms.
[2022-05-16 18:58:33] [INFO ] Added : 13 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 49700 steps, including 1685 resets, run finished after 116 ms. (steps per millisecond=428 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 350/350 places, 880/880 transitions.
Applied a total of 0 rules in 29 ms. Remains 350 /350 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 880/880 transitions.
Starting structural reductions, iteration 0 : 350/350 places, 880/880 transitions.
Applied a total of 0 rules in 21 ms. Remains 350 /350 variables (removed 0) and now considering 880/880 (removed 0) transitions.
// Phase 1: matrix 880 rows 350 cols
[2022-05-16 18:58:33] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:58:33] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 880 rows 350 cols
[2022-05-16 18:58:33] [INFO ] Computed 33 place invariants in 10 ms
[2022-05-16 18:58:34] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2022-05-16 18:58:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 880 rows 350 cols
[2022-05-16 18:58:34] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-16 18:58:34] [INFO ] Dead Transitions using invariants and state equation in 309 ms returned []
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 880/880 transitions.
Ending property specific reduction for ASLink-PT-04a-UpperBounds-00 in 5823 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-15
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:34] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 201 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 882 rows 352 cols
[2022-05-16 18:58:34] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 18:58:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:35] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-05-16 18:58:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:35] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:35] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-05-16 18:58:35] [INFO ] Computed and/alt/rep : 179/841/179 causal constraints (skipped 681 transitions) in 45 ms.
[2022-05-16 18:58:35] [INFO ] Added : 22 causal constraints over 5 iterations in 282 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 44000 steps, including 1634 resets, run finished after 71 ms. (steps per millisecond=619 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 882/882 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 351 transition count 881
Applied a total of 2 rules in 12 ms. Remains 351 /352 variables (removed 1) and now considering 881/882 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/352 places, 881/882 transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-16 18:58:35] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 19460 resets, run finished after 1615 ms. (steps per millisecond=619 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5832 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :0
// Phase 1: matrix 881 rows 351 cols
[2022-05-16 18:58:38] [INFO ] Computed 33 place invariants in 19 ms
[2022-05-16 18:58:38] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:38] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-05-16 18:58:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-05-16 18:58:38] [INFO ] Computed and/alt/rep : 178/840/178 causal constraints (skipped 681 transitions) in 63 ms.
[2022-05-16 18:58:39] [INFO ] Added : 30 causal constraints over 6 iterations in 580 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 54400 steps, including 2315 resets, run finished after 127 ms. (steps per millisecond=428 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Starting structural reductions, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-16 18:58:39] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 18:58:40] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-16 18:58:40] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:58:40] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2022-05-16 18:58:40] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-16 18:58:40] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:58:40] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Ending property specific reduction for ASLink-PT-04a-UpperBounds-15 in 6146 ms.
[2022-05-16 18:58:41] [INFO ] Flatten gal took : 201 ms
[2022-05-16 18:58:41] [INFO ] Applying decomposition
[2022-05-16 18:58:41] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1106197263759825909.txt, -o, /tmp/graph1106197263759825909.bin, -w, /tmp/graph1106197263759825909.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1106197263759825909.bin, -l, -1, -v, -w, /tmp/graph1106197263759825909.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 18:58:41] [INFO ] Decomposing Gal with order
[2022-05-16 18:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:58:42] [INFO ] Removed a total of 1703 redundant transitions.
[2022-05-16 18:58:42] [INFO ] Flatten gal took : 170 ms
[2022-05-16 18:58:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 18 ms.
[2022-05-16 18:58:42] [INFO ] Time to serialize gal into /tmp/UpperBounds14396619702309524515.gal : 12 ms
[2022-05-16 18:58:42] [INFO ] Time to serialize properties into /tmp/UpperBounds14328153738971154515.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14396619702309524515.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14328153738971154515.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14396619702309524515.gal -t CGAL -reachable-file /tmp/UpperBounds14328153738971154515.prop --nowitness
Loading property file /tmp/UpperBounds14328153738971154515.prop.
Detected timeout of ITS tools.
[2022-05-16 19:19:23] [INFO ] Applying decomposition
[2022-05-16 19:19:23] [INFO ] Flatten gal took : 86 ms
[2022-05-16 19:19:23] [INFO ] Decomposing Gal with order
[2022-05-16 19:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:19:23] [INFO ] Removed a total of 1637 redundant transitions.
[2022-05-16 19:19:23] [INFO ] Flatten gal took : 136 ms
[2022-05-16 19:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 315 labels/synchronizations in 34 ms.
[2022-05-16 19:19:23] [INFO ] Time to serialize gal into /tmp/UpperBounds9040772005248142171.gal : 5 ms
[2022-05-16 19:19:23] [INFO ] Time to serialize properties into /tmp/UpperBounds14727805260068012458.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9040772005248142171.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14727805260068012458.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9040772005248142171.gal -t CGAL -reachable-file /tmp/UpperBounds14727805260068012458.prop --nowitness
Loading property file /tmp/UpperBounds14727805260068012458.prop.
Detected timeout of ITS tools.
[2022-05-16 19:40:05] [INFO ] Flatten gal took : 129 ms
[2022-05-16 19:40:05] [INFO ] Input system was already deterministic with 882 transitions.
[2022-05-16 19:40:05] [INFO ] Transformed 352 places.
[2022-05-16 19:40:05] [INFO ] Transformed 882 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 19:40:05] [INFO ] Time to serialize gal into /tmp/UpperBounds10858090193294644326.gal : 6 ms
[2022-05-16 19:40:05] [INFO ] Time to serialize properties into /tmp/UpperBounds2192403751248734092.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10858090193294644326.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2192403751248734092.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10858090193294644326.gal -t CGAL -reachable-file /tmp/UpperBounds2192403751248734092.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2192403751248734092.prop.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ASLink-PT-04a, 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 r010-tajo-165245701500022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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