Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 417K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-02b-UpperBounds-00
FORMULA_NAME ASLink-PT-02b-UpperBounds-01
FORMULA_NAME ASLink-PT-02b-UpperBounds-02
FORMULA_NAME ASLink-PT-02b-UpperBounds-03
FORMULA_NAME ASLink-PT-02b-UpperBounds-04
FORMULA_NAME ASLink-PT-02b-UpperBounds-05
FORMULA_NAME ASLink-PT-02b-UpperBounds-06
FORMULA_NAME ASLink-PT-02b-UpperBounds-07
FORMULA_NAME ASLink-PT-02b-UpperBounds-08
FORMULA_NAME ASLink-PT-02b-UpperBounds-09
FORMULA_NAME ASLink-PT-02b-UpperBounds-10
FORMULA_NAME ASLink-PT-02b-UpperBounds-11
FORMULA_NAME ASLink-PT-02b-UpperBounds-12
FORMULA_NAME ASLink-PT-02b-UpperBounds-13
FORMULA_NAME ASLink-PT-02b-UpperBounds-14
FORMULA_NAME ASLink-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620396056972

Running Version 0
[2021-05-07 14:00:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 14:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 14:00:58] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2021-05-07 14:00:58] [INFO ] Transformed 1242 places.
[2021-05-07 14:00:58] [INFO ] Transformed 1621 transitions.
[2021-05-07 14:00:58] [INFO ] Found NUPN structural information;
[2021-05-07 14:00:58] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2021-05-07 14:00:58] [INFO ] Computed 121 place invariants in 85 ms
Incomplete random walk after 10000 steps, including 40 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :11
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
// Phase 1: matrix 1621 rows 1242 cols
[2021-05-07 14:00:59] [INFO ] Computed 121 place invariants in 74 ms
[2021-05-07 14:00:59] [INFO ] [Real]Absence check using 27 positive place invariants in 30 ms returned sat
[2021-05-07 14:00:59] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2021-05-07 14:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:00] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2021-05-07 14:01:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:00] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2021-05-07 14:01:00] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 28 ms returned sat
[2021-05-07 14:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:02] [INFO ] [Nat]Absence check using state equation in 2251 ms returned sat
[2021-05-07 14:01:03] [INFO ] Deduced a trap composed of 279 places in 361 ms of which 6 ms to minimize.
[2021-05-07 14:01:03] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 2 ms to minimize.
[2021-05-07 14:01:05] [INFO ] Deduced a trap composed of 12 places in 504 ms of which 1 ms to minimize.
[2021-05-07 14:01:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-07 14:01:06] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned sat
[2021-05-07 14:01:06] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2021-05-07 14:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:06] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2021-05-07 14:01:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2021-05-07 14:01:06] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2021-05-07 14:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:08] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2021-05-07 14:01:08] [INFO ] Deduced a trap composed of 58 places in 473 ms of which 1 ms to minimize.
[2021-05-07 14:01:09] [INFO ] Deduced a trap composed of 139 places in 443 ms of which 1 ms to minimize.
[2021-05-07 14:01:09] [INFO ] Deduced a trap composed of 186 places in 521 ms of which 0 ms to minimize.
[2021-05-07 14:01:10] [INFO ] Deduced a trap composed of 76 places in 467 ms of which 2 ms to minimize.
[2021-05-07 14:01:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2180 ms
[2021-05-07 14:01:10] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 104 ms.
[2021-05-07 14:01:11] [INFO ] Added : 45 causal constraints over 9 iterations in 1378 ms. Result :unknown
[2021-05-07 14:01:11] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2021-05-07 14:01:11] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 28 ms returned sat
[2021-05-07 14:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:12] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2021-05-07 14:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:12] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2021-05-07 14:01:12] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 28 ms returned sat
[2021-05-07 14:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:15] [INFO ] [Nat]Absence check using state equation in 2632 ms returned sat
[2021-05-07 14:01:15] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 1 ms to minimize.
[2021-05-07 14:01:15] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2021-05-07 14:01:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2021-05-07 14:01:16] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 81 ms.
[2021-05-07 14:01:17] [INFO ] Added : 10 causal constraints over 2 iterations in 1623 ms. Result :unknown
[2021-05-07 14:01:17] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2021-05-07 14:01:17] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 30 ms returned sat
[2021-05-07 14:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:18] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2021-05-07 14:01:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2021-05-07 14:01:18] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 27 ms returned sat
[2021-05-07 14:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:23] [INFO ] [Nat]Absence check using state equation in 4786 ms returned unknown
[2021-05-07 14:01:23] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2021-05-07 14:01:23] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 33 ms returned sat
[2021-05-07 14:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:24] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-07 14:01:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2021-05-07 14:01:24] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 31 ms returned sat
[2021-05-07 14:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:29] [INFO ] [Nat]Absence check using state equation in 4788 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 44700 steps, including 525 resets, run finished after 189 ms. (steps per millisecond=236 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 254400 steps, including 1002 resets, run finished after 688 ms. (steps per millisecond=369 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 1242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1242 transition count 1343
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 292 rules applied. Total rules applied 570 place count 964 transition count 1329
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 574 place count 960 transition count 1329
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 574 place count 960 transition count 1046
Deduced a syphon composed of 283 places in 3 ms
Ensure Unique test removed 22 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1162 place count 655 transition count 1046
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 18 rules applied. Total rules applied 1180 place count 652 transition count 1031
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1195 place count 637 transition count 1031
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1195 place count 637 transition count 1023
Deduced a syphon composed of 8 places in 4 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1219 place count 621 transition count 1023
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1219 place count 621 transition count 1015
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1235 place count 613 transition count 1015
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1273 place count 575 transition count 977
Iterating global reduction 5 with 38 rules applied. Total rules applied 1311 place count 575 transition count 977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1312 place count 575 transition count 976
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1312 place count 575 transition count 962
Deduced a syphon composed of 14 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 1341 place count 560 transition count 962
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1341 place count 560 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1344 place count 558 transition count 961
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1347 place count 555 transition count 940
Iterating global reduction 6 with 3 rules applied. Total rules applied 1350 place count 555 transition count 940
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1350 place count 555 transition count 938
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1354 place count 553 transition count 938
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1355 place count 552 transition count 930
Iterating global reduction 6 with 1 rules applied. Total rules applied 1356 place count 552 transition count 930
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1357 place count 551 transition count 922
Iterating global reduction 6 with 1 rules applied. Total rules applied 1358 place count 551 transition count 922
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1359 place count 550 transition count 914
Iterating global reduction 6 with 1 rules applied. Total rules applied 1360 place count 550 transition count 914
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1361 place count 549 transition count 906
Iterating global reduction 6 with 1 rules applied. Total rules applied 1362 place count 549 transition count 906
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1363 place count 548 transition count 898
Iterating global reduction 6 with 1 rules applied. Total rules applied 1364 place count 548 transition count 898
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1365 place count 547 transition count 890
Iterating global reduction 6 with 1 rules applied. Total rules applied 1366 place count 547 transition count 890
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1367 place count 546 transition count 882
Iterating global reduction 6 with 1 rules applied. Total rules applied 1368 place count 546 transition count 882
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1369 place count 545 transition count 874
Iterating global reduction 6 with 1 rules applied. Total rules applied 1370 place count 545 transition count 874
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1371 place count 544 transition count 866
Iterating global reduction 6 with 1 rules applied. Total rules applied 1372 place count 544 transition count 866
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1373 place count 543 transition count 858
Iterating global reduction 6 with 1 rules applied. Total rules applied 1374 place count 543 transition count 858
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1375 place count 542 transition count 850
Iterating global reduction 6 with 1 rules applied. Total rules applied 1376 place count 542 transition count 850
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1377 place count 541 transition count 842
Iterating global reduction 6 with 1 rules applied. Total rules applied 1378 place count 541 transition count 842
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1379 place count 540 transition count 834
Iterating global reduction 6 with 1 rules applied. Total rules applied 1380 place count 540 transition count 834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1381 place count 539 transition count 826
Iterating global reduction 6 with 1 rules applied. Total rules applied 1382 place count 539 transition count 826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1383 place count 538 transition count 818
Iterating global reduction 6 with 1 rules applied. Total rules applied 1384 place count 538 transition count 818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 537 transition count 810
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 537 transition count 810
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 1518 place count 471 transition count 744
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1519 place count 470 transition count 743
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1521 place count 469 transition count 743
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1522 place count 468 transition count 742
Iterating global reduction 6 with 1 rules applied. Total rules applied 1523 place count 468 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 1525 place count 468 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1526 place count 467 transition count 740
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1528 place count 466 transition count 749
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1531 place count 466 transition count 746
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1534 place count 463 transition count 746
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1535 place count 463 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1536 place count 462 transition count 745
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1537 place count 461 transition count 744
Reduce places removed 3 places and 0 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 10 with 4 rules applied. Total rules applied 1541 place count 458 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1542 place count 457 transition count 743
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 4 Pre rules applied. Total rules applied 1542 place count 457 transition count 739
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1550 place count 453 transition count 739
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 1552 place count 451 transition count 739
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1560 place count 447 transition count 735
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1562 place count 445 transition count 733
Iterating global reduction 13 with 2 rules applied. Total rules applied 1564 place count 445 transition count 733
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1566 place count 445 transition count 731
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1568 place count 443 transition count 731
Applied a total of 1568 rules in 834 ms. Remains 443 /1242 variables (removed 799) and now considering 731/1621 (removed 890) transitions.
Finished structural reductions, in 1 iterations. Remains : 443/1242 places, 731/1621 transitions.
// Phase 1: matrix 731 rows 443 cols
[2021-05-07 14:01:31] [INFO ] Computed 80 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 16188 resets, run finished after 2708 ms. (steps per millisecond=369 ) properties (out of 5) seen :2
FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5526 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5565 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5575 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 3) seen :0
// Phase 1: matrix 731 rows 443 cols
[2021-05-07 14:01:37] [INFO ] Computed 80 place invariants in 9 ms
[2021-05-07 14:01:37] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2021-05-07 14:01:37] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-07 14:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:37] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-07 14:01:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2021-05-07 14:01:37] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 14:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:38] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2021-05-07 14:01:38] [INFO ] Computed and/alt/rep : 285/1077/285 causal constraints (skipped 429 transitions) in 54 ms.
[2021-05-07 14:01:38] [INFO ] Added : 68 causal constraints over 14 iterations in 684 ms. Result :sat
Minimization took 278 ms.
[2021-05-07 14:01:39] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:39] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 14:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:39] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-07 14:01:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:39] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 11 ms returned sat
[2021-05-07 14:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:39] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-07 14:01:39] [INFO ] Computed and/alt/rep : 285/1077/285 causal constraints (skipped 429 transitions) in 39 ms.
[2021-05-07 14:01:41] [INFO ] Added : 186 causal constraints over 38 iterations in 1323 ms. Result :sat
Minimization took 260 ms.
[2021-05-07 14:01:41] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:41] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 11 ms returned sat
[2021-05-07 14:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:41] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-07 14:01:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:41] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 11 ms returned sat
[2021-05-07 14:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:41] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-07 14:01:41] [INFO ] Computed and/alt/rep : 285/1077/285 causal constraints (skipped 429 transitions) in 39 ms.
[2021-05-07 14:01:43] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 0 ms to minimize.
[2021-05-07 14:01:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2021-05-07 14:01:43] [INFO ] Added : 139 causal constraints over 28 iterations in 1381 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 79200 steps, including 1670 resets, run finished after 213 ms. (steps per millisecond=371 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 75300 steps, including 1916 resets, run finished after 201 ms. (steps per millisecond=374 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 179300 steps, including 3110 resets, run finished after 480 ms. (steps per millisecond=373 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 443/443 places, 731/731 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 443 transition count 729
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 440 transition count 729
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 440 transition count 726
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 436 transition count 726
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 435 transition count 726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 433 transition count 724
Applied a total of 17 rules in 31 ms. Remains 433 /443 variables (removed 10) and now considering 724/731 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/443 places, 724/731 transitions.
// Phase 1: matrix 724 rows 433 cols
[2021-05-07 14:01:44] [INFO ] Computed 77 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 16254 resets, run finished after 2402 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5474 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5649 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5534 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 3) seen :0
// Phase 1: matrix 724 rows 433 cols
[2021-05-07 14:01:50] [INFO ] Computed 77 place invariants in 8 ms
[2021-05-07 14:01:50] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:50] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 10 ms returned sat
[2021-05-07 14:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:50] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-07 14:01:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:50] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 9 ms returned sat
[2021-05-07 14:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:50] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-07 14:01:50] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 37 ms.
[2021-05-07 14:01:51] [INFO ] Added : 67 causal constraints over 15 iterations in 678 ms. Result :sat
Minimization took 234 ms.
[2021-05-07 14:01:51] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2021-05-07 14:01:51] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 10 ms returned sat
[2021-05-07 14:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:51] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-07 14:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2021-05-07 14:01:52] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 10 ms returned sat
[2021-05-07 14:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:52] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-07 14:01:52] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 44 ms.
[2021-05-07 14:01:53] [INFO ] Added : 83 causal constraints over 17 iterations in 795 ms. Result :sat
Minimization took 182 ms.
[2021-05-07 14:01:53] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2021-05-07 14:01:53] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2021-05-07 14:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:53] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-07 14:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2021-05-07 14:01:53] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 10 ms returned sat
[2021-05-07 14:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:53] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-07 14:01:53] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 37 ms.
[2021-05-07 14:01:54] [INFO ] Added : 159 causal constraints over 32 iterations in 1116 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 46300 steps, including 1002 resets, run finished after 116 ms. (steps per millisecond=399 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 123600 steps, including 1989 resets, run finished after 326 ms. (steps per millisecond=379 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 77700 steps, including 1002 resets, run finished after 186 ms. (steps per millisecond=417 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 724/724 transitions.
Starting structural reductions, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
// Phase 1: matrix 724 rows 433 cols
[2021-05-07 14:01:55] [INFO ] Computed 77 place invariants in 8 ms
[2021-05-07 14:01:56] [INFO ] Implicit Places using invariants in 397 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 152, 153, 155, 172, 190, 259, 263, 264, 267, 278, 279, 280, 298, 300, 304, 322, 323, 324, 325, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391, 397]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 399 ms to find 38 implicit places.
[2021-05-07 14:01:56] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 724 rows 395 cols
[2021-05-07 14:01:56] [INFO ] Computed 39 place invariants in 11 ms
[2021-05-07 14:01:56] [INFO ] Dead Transitions using invariants and state equation in 295 ms returned []
Starting structural reductions, iteration 1 : 395/433 places, 724/724 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 395 transition count 661
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 129 place count 332 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 331 transition count 658
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 130 place count 331 transition count 644
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 159 place count 316 transition count 644
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 3 with 12 rules applied. Total rules applied 171 place count 312 transition count 636
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 179 place count 304 transition count 636
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 194 place count 289 transition count 621
Iterating global reduction 5 with 15 rules applied. Total rules applied 209 place count 289 transition count 621
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 212 place count 289 transition count 618
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 212 place count 289 transition count 617
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 288 transition count 617
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 217 place count 285 transition count 611
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 285 transition count 611
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 284 transition count 610
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 284 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 283 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 283 transition count 608
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 266 place count 262 transition count 587
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 268 place count 260 transition count 585
Iterating global reduction 6 with 2 rules applied. Total rules applied 270 place count 260 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 272 place count 260 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 276 place count 258 transition count 584
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 281 place count 258 transition count 579
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 287 place count 252 transition count 579
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 252 transition count 579
Applied a total of 293 rules in 76 ms. Remains 252 /395 variables (removed 143) and now considering 579/724 (removed 145) transitions.
// Phase 1: matrix 579 rows 252 cols
[2021-05-07 14:01:56] [INFO ] Computed 33 place invariants in 5 ms
[2021-05-07 14:01:56] [INFO ] Implicit Places using invariants in 266 ms returned [73, 91, 97, 100, 102, 107, 108, 160, 177, 183, 186, 188]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 268 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 240/433 places, 579/724 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 234 transition count 573
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 234 transition count 573
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 232 transition count 571
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 232 transition count 571
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 228 transition count 567
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 228 transition count 561
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 222 transition count 561
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 222 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 220 transition count 559
Applied a total of 40 rules in 34 ms. Remains 220 /240 variables (removed 20) and now considering 559/579 (removed 20) transitions.
// Phase 1: matrix 559 rows 220 cols
[2021-05-07 14:01:56] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:01:57] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 559 rows 220 cols
[2021-05-07 14:01:57] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:01:57] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 220/433 places, 559/724 transitions.
Successfully produced net in file /tmp/petri1000_8006770427251690166.dot
Successfully produced net in file /tmp/petri1001_3212046995937485868.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 557 rows 220 cols
[2021-05-07 14:01:57] [INFO ] Computed 21 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25550 resets, run finished after 2182 ms. (steps per millisecond=458 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9643 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9699 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9681 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 3) seen :0
// Phase 1: matrix 557 rows 220 cols
[2021-05-07 14:02:02] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:02] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:02] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-07 14:02:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:02] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:02] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-07 14:02:03] [INFO ] Computed and/alt/rep : 99/565/99 causal constraints (skipped 441 transitions) in 28 ms.
[2021-05-07 14:02:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2021-05-07 14:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-07 14:02:03] [INFO ] Added : 22 causal constraints over 7 iterations in 420 ms. Result :sat
Minimization took 81 ms.
[2021-05-07 14:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-07 14:02:03] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:03] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-07 14:02:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:03] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:03] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-07 14:02:03] [INFO ] Computed and/alt/rep : 99/565/99 causal constraints (skipped 441 transitions) in 28 ms.
[2021-05-07 14:02:04] [INFO ] Added : 46 causal constraints over 10 iterations in 318 ms. Result :sat
Minimization took 83 ms.
[2021-05-07 14:02:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:04] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:04] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-07 14:02:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:04] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:04] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-07 14:02:04] [INFO ] Computed and/alt/rep : 99/565/99 causal constraints (skipped 441 transitions) in 29 ms.
[2021-05-07 14:02:04] [INFO ] Added : 41 causal constraints over 9 iterations in 306 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 61400 steps, including 1601 resets, run finished after 136 ms. (steps per millisecond=451 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 45100 steps, including 1918 resets, run finished after 102 ms. (steps per millisecond=442 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 43000 steps, including 1415 resets, run finished after 102 ms. (steps per millisecond=421 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 220/220 places, 557/557 transitions.
Graph (complete) has 1365 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 218 transition count 557
Applied a total of 3 rules in 16 ms. Remains 218 /220 variables (removed 2) and now considering 557/557 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/220 places, 557/557 transitions.
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:05] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25369 resets, run finished after 2355 ms. (steps per millisecond=424 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9592 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9765 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9617 resets, run finished after 983 ms. (steps per millisecond=1017 ) properties (out of 3) seen :0
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:10] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:02:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:10] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:10] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-07 14:02:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-07 14:02:10] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:11] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-07 14:02:11] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 29 ms.
[2021-05-07 14:02:11] [INFO ] Added : 39 causal constraints over 9 iterations in 281 ms. Result :sat
Minimization took 90 ms.
[2021-05-07 14:02:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:11] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-07 14:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:11] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-07 14:02:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:11] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:11] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-07 14:02:11] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 27 ms.
[2021-05-07 14:02:12] [INFO ] Added : 21 causal constraints over 5 iterations in 250 ms. Result :sat
Minimization took 90 ms.
[2021-05-07 14:02:12] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-07 14:02:12] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:12] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-07 14:02:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-07 14:02:12] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:12] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-07 14:02:12] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 27 ms.
[2021-05-07 14:02:12] [INFO ] Added : 43 causal constraints over 9 iterations in 299 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 40400 steps, including 1745 resets, run finished after 149 ms. (steps per millisecond=271 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 46800 steps, including 1915 resets, run finished after 174 ms. (steps per millisecond=268 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 61400 steps, including 1803 resets, run finished after 172 ms. (steps per millisecond=356 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 218/218 places, 557/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 218 /218 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 557/557 transitions.
Starting structural reductions, iteration 0 : 218/218 places, 557/557 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 557/557 (removed 0) transitions.
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:13] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-07 14:02:13] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:13] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:02:13] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2021-05-07 14:02:13] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:13] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:14] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 557/557 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-03
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:14] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 272 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 103 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:14] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:02:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:14] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:14] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-07 14:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:14] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:14] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-07 14:02:14] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 28 ms.
[2021-05-07 14:02:14] [INFO ] Added : 39 causal constraints over 9 iterations in 276 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 61400 steps, including 1793 resets, run finished after 143 ms. (steps per millisecond=429 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 218/218 places, 557/557 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 216 transition count 555
Applied a total of 4 rules in 8 ms. Remains 216 /218 variables (removed 2) and now considering 555/557 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 216/218 places, 555/557 transitions.
// Phase 1: matrix 555 rows 216 cols
[2021-05-07 14:02:15] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25498 resets, run finished after 2135 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9615 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 1) seen :0
// Phase 1: matrix 555 rows 216 cols
[2021-05-07 14:02:18] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-07 14:02:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:18] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:18] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-07 14:02:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:18] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:18] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-07 14:02:18] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 27 ms.
[2021-05-07 14:02:18] [INFO ] Added : 20 causal constraints over 5 iterations in 349 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 36100 steps, including 1003 resets, run finished after 74 ms. (steps per millisecond=487 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
// Phase 1: matrix 555 rows 216 cols
[2021-05-07 14:02:18] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:19] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 555 rows 216 cols
[2021-05-07 14:02:19] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:02:19] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2021-05-07 14:02:19] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 555 rows 216 cols
[2021-05-07 14:02:19] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-07 14:02:19] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Finished structural reductions, in 1 iterations. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-03 in 5566 ms.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-06
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:19] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 266 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:19] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:19] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:19] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:19] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-07 14:02:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:19] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:19] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-07 14:02:20] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 30 ms.
[2021-05-07 14:02:20] [INFO ] Added : 21 causal constraints over 5 iterations in 265 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 46800 steps, including 1897 resets, run finished after 111 ms. (steps per millisecond=421 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 218/218 places, 557/557 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 216 transition count 555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 216 transition count 554
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 6 place count 215 transition count 554
Applied a total of 6 rules in 10 ms. Remains 215 /218 variables (removed 3) and now considering 554/557 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 215/218 places, 554/557 transitions.
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:20] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25202 resets, run finished after 2121 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9616 resets, run finished after 964 ms. (steps per millisecond=1037 ) properties (out of 1) seen :0
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:23] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 14:02:23] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:23] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-07 14:02:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:24] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-07 14:02:24] [INFO ] Computed and/alt/rep : 96/560/96 causal constraints (skipped 441 transitions) in 28 ms.
[2021-05-07 14:02:24] [INFO ] Added : 27 causal constraints over 6 iterations in 242 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 44100 steps, including 2253 resets, run finished after 95 ms. (steps per millisecond=464 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 215/215 places, 554/554 transitions.
Starting structural reductions, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:24] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:24] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:24] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:24] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2021-05-07 14:02:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:24] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:25] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 215/215 places, 554/554 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-06 in 5496 ms.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-14
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:25] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 238 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 557 rows 218 cols
[2021-05-07 14:02:25] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:25] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-07 14:02:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:25] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-07 14:02:25] [INFO ] Computed and/alt/rep : 99/563/99 causal constraints (skipped 441 transitions) in 28 ms.
[2021-05-07 14:02:25] [INFO ] Added : 43 causal constraints over 9 iterations in 304 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Incomplete Parikh walk after 40400 steps, including 1722 resets, run finished after 95 ms. (steps per millisecond=425 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 218/218 places, 557/557 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 218 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 216 transition count 555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 216 transition count 554
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 215 transition count 554
Applied a total of 6 rules in 10 ms. Remains 215 /218 variables (removed 3) and now considering 554/557 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 215/218 places, 554/557 transitions.
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:25] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25415 resets, run finished after 2127 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9685 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 1) seen :0
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:29] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:29] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:29] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-07 14:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-07 14:02:29] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-07 14:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:29] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-07 14:02:29] [INFO ] Computed and/alt/rep : 96/560/96 causal constraints (skipped 441 transitions) in 27 ms.
[2021-05-07 14:02:29] [INFO ] Added : 11 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Incomplete Parikh walk after 30300 steps, including 1296 resets, run finished after 73 ms. (steps per millisecond=415 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 215/215 places, 554/554 transitions.
Starting structural reductions, iteration 0 : 215/215 places, 554/554 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 554/554 (removed 0) transitions.
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:29] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:29] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:29] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 14:02:30] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2021-05-07 14:02:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 554 rows 215 cols
[2021-05-07 14:02:30] [INFO ] Computed 21 place invariants in 13 ms
[2021-05-07 14:02:30] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 215/215 places, 554/554 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-14 in 5245 ms.
[2021-05-07 14:02:30] [INFO ] Flatten gal took : 107 ms
[2021-05-07 14:02:30] [INFO ] Applying decomposition
[2021-05-07 14:02:30] [INFO ] Flatten gal took : 42 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/graph11049325936127193890.txt, -o, /tmp/graph11049325936127193890.bin, -w, /tmp/graph11049325936127193890.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/graph11049325936127193890.bin, -l, -1, -v, -w, /tmp/graph11049325936127193890.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 14:02:30] [INFO ] Decomposing Gal with order
[2021-05-07 14:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 14:02:31] [INFO ] Removed a total of 1173 redundant transitions.
[2021-05-07 14:02:31] [INFO ] Flatten gal took : 90 ms
[2021-05-07 14:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 14 ms.
[2021-05-07 14:02:31] [INFO ] Time to serialize gal into /tmp/UpperBounds14319925343795712985.gal : 8 ms
[2021-05-07 14:02:31] [INFO ] Time to serialize properties into /tmp/UpperBounds16274777653859411145.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/UpperBounds14319925343795712985.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16274777653859411145.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/UpperBounds14319925343795712985.gal -t CGAL -reachable-file /tmp/UpperBounds16274777653859411145.prop --nowitness
Loading property file /tmp/UpperBounds16274777653859411145.prop.
Detected timeout of ITS tools.
[2021-05-07 14:23:01] [INFO ] Applying decomposition
[2021-05-07 14:23:01] [INFO ] Flatten gal took : 32 ms
[2021-05-07 14:23:01] [INFO ] Decomposing Gal with order
[2021-05-07 14:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 14:23:01] [INFO ] Removed a total of 1027 redundant transitions.
[2021-05-07 14:23:01] [INFO ] Flatten gal took : 73 ms
[2021-05-07 14:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 21 ms.
[2021-05-07 14:23:01] [INFO ] Time to serialize gal into /tmp/UpperBounds12428644379095719191.gal : 6 ms
[2021-05-07 14:23:01] [INFO ] Time to serialize properties into /tmp/UpperBounds808794149938908133.prop : 4 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/UpperBounds12428644379095719191.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds808794149938908133.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/UpperBounds12428644379095719191.gal -t CGAL -reachable-file /tmp/UpperBounds808794149938908133.prop --nowitness
Loading property file /tmp/UpperBounds808794149938908133.prop.
Detected timeout of ITS tools.
[2021-05-07 14:43:31] [INFO ] Flatten gal took : 31 ms
[2021-05-07 14:43:31] [INFO ] Input system was already deterministic with 557 transitions.
[2021-05-07 14:43:31] [INFO ] Transformed 218 places.
[2021-05-07 14:43:31] [INFO ] Transformed 557 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
[2021-05-07 14:43:31] [INFO ] Time to serialize gal into /tmp/UpperBounds16507777551276867789.gal : 3 ms
[2021-05-07 14:43:31] [INFO ] Time to serialize properties into /tmp/UpperBounds12560087129721168312.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/UpperBounds16507777551276867789.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12560087129721168312.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/UpperBounds16507777551276867789.gal -t CGAL -reachable-file /tmp/UpperBounds12560087129721168312.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/UpperBounds12560087129721168312.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-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, 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 r007-tall-162037989400037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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