Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 6.9K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 417K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-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 1652727396718

Running Version 0
[2022-05-16 18:56:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:56:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:38] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-05-16 18:56:38] [INFO ] Transformed 1242 places.
[2022-05-16 18:56:38] [INFO ] Transformed 1621 transitions.
[2022-05-16 18:56:38] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:38] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2022-05-16 18:56:38] [INFO ] Computed 121 place invariants in 76 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :13
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-14 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-10 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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 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 10000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1621 rows 1242 cols
[2022-05-16 18:56:39] [INFO ] Computed 121 place invariants in 48 ms
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:40] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2022-05-16 18:56:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:40] [INFO ] [Nat]Absence check using 27 positive place invariants in 27 ms returned sat
[2022-05-16 18:56:40] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 31 ms returned sat
[2022-05-16 18:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:41] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2022-05-16 18:56:42] [INFO ] Deduced a trap composed of 139 places in 542 ms of which 4 ms to minimize.
[2022-05-16 18:56:42] [INFO ] Deduced a trap composed of 185 places in 597 ms of which 2 ms to minimize.
[2022-05-16 18:56:45] [INFO ] Deduced a trap composed of 12 places in 736 ms of which 15 ms to minimize.
[2022-05-16 18:56:45] [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)
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 27 positive place invariants in 30 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 38 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:47] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2022-05-16 18:56:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 29 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:49] [INFO ] [Nat]Absence check using state equation in 1925 ms returned sat
[2022-05-16 18:56:49] [INFO ] Deduced a trap composed of 259 places in 529 ms of which 3 ms to minimize.
[2022-05-16 18:56:50] [INFO ] Deduced a trap composed of 171 places in 532 ms of which 2 ms to minimize.
[2022-05-16 18:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1314 ms
[2022-05-16 18:56:50] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 139 ms.
[2022-05-16 18:56:52] [INFO ] Added : 5 causal constraints over 1 iterations in 1535 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 54500 steps, including 756 resets, run finished after 195 ms. (steps per millisecond=279 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1242 transition count 1339
Reduce places removed 282 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 296 rules applied. Total rules applied 578 place count 960 transition count 1325
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 582 place count 956 transition count 1325
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 582 place count 956 transition count 1042
Deduced a syphon composed of 283 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 589 rules applied. Total rules applied 1171 place count 650 transition count 1042
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 1189 place count 648 transition count 1026
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1205 place count 632 transition count 1026
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1205 place count 632 transition count 1018
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 1229 place count 616 transition count 1018
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1229 place count 616 transition count 1010
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 1245 place count 608 transition count 1010
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1283 place count 570 transition count 972
Iterating global reduction 5 with 38 rules applied. Total rules applied 1321 place count 570 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1322 place count 570 transition count 971
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1322 place count 570 transition count 957
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 1351 place count 555 transition count 957
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1351 place count 555 transition count 956
Deduced a syphon composed of 1 places in 1 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 1354 place count 553 transition count 956
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1357 place count 550 transition count 935
Iterating global reduction 6 with 3 rules applied. Total rules applied 1360 place count 550 transition count 935
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1360 place count 550 transition count 933
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1364 place count 548 transition count 933
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1365 place count 547 transition count 925
Iterating global reduction 6 with 1 rules applied. Total rules applied 1366 place count 547 transition count 925
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1367 place count 546 transition count 917
Iterating global reduction 6 with 1 rules applied. Total rules applied 1368 place count 546 transition count 917
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1369 place count 545 transition count 909
Iterating global reduction 6 with 1 rules applied. Total rules applied 1370 place count 545 transition count 909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1371 place count 544 transition count 901
Iterating global reduction 6 with 1 rules applied. Total rules applied 1372 place count 544 transition count 901
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1373 place count 543 transition count 893
Iterating global reduction 6 with 1 rules applied. Total rules applied 1374 place count 543 transition count 893
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1375 place count 542 transition count 885
Iterating global reduction 6 with 1 rules applied. Total rules applied 1376 place count 542 transition count 885
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1377 place count 541 transition count 877
Iterating global reduction 6 with 1 rules applied. Total rules applied 1378 place count 541 transition count 877
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1379 place count 540 transition count 869
Iterating global reduction 6 with 1 rules applied. Total rules applied 1380 place count 540 transition count 869
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1381 place count 539 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 1382 place count 539 transition count 861
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1383 place count 538 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 1384 place count 538 transition count 853
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 537 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 537 transition count 845
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1387 place count 536 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 1388 place count 536 transition count 837
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1389 place count 535 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 1390 place count 535 transition count 829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1391 place count 534 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 1392 place count 534 transition count 821
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1393 place count 533 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 1394 place count 533 transition count 813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1395 place count 532 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 1396 place count 532 transition count 805
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 1528 place count 466 transition count 739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1529 place count 465 transition count 738
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1531 place count 464 transition count 738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1532 place count 463 transition count 737
Iterating global reduction 6 with 1 rules applied. Total rules applied 1533 place count 463 transition count 737
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 1535 place count 463 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1536 place count 462 transition count 735
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 1538 place count 461 transition count 744
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1541 place count 461 transition count 741
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1544 place count 458 transition count 741
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1545 place count 458 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1546 place count 457 transition count 740
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1547 place count 456 transition count 739
Reduce places removed 4 places and 0 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 10 with 6 rules applied. Total rules applied 1553 place count 452 transition count 737
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1555 place count 450 transition count 737
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1555 place count 450 transition count 731
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1568 place count 443 transition count 731
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 1571 place count 440 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1571 place count 440 transition count 730
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1573 place count 439 transition count 730
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1583 place count 434 transition count 725
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1585 place count 432 transition count 723
Iterating global reduction 13 with 2 rules applied. Total rules applied 1587 place count 432 transition count 723
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1589 place count 432 transition count 721
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1591 place count 430 transition count 721
Applied a total of 1591 rules in 809 ms. Remains 430 /1242 variables (removed 812) and now considering 721/1621 (removed 900) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/1242 places, 721/1621 transitions.
// Phase 1: matrix 721 rows 430 cols
[2022-05-16 18:56:53] [INFO ] Computed 77 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16202 resets, run finished after 1778 ms. (steps per millisecond=562 ) properties (out of 2) seen :1
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5624 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 1) seen :0
// Phase 1: matrix 721 rows 430 cols
[2022-05-16 18:56:55] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-16 18:56:55] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 14 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:56] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-16 18:56:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:56] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-05-16 18:56:56] [INFO ] Computed and/alt/rep : 273/1071/273 causal constraints (skipped 431 transitions) in 48 ms.
[2022-05-16 18:56:57] [INFO ] Added : 136 causal constraints over 28 iterations in 1165 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 71000 steps, including 1999 resets, run finished after 199 ms. (steps per millisecond=356 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 721/721 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 430 transition count 720
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 429 transition count 720
Applied a total of 2 rules in 14 ms. Remains 429 /430 variables (removed 1) and now considering 720/721 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/430 places, 720/721 transitions.
// Phase 1: matrix 720 rows 429 cols
[2022-05-16 18:56:58] [INFO ] Computed 77 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16034 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5522 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :0
// Phase 1: matrix 720 rows 429 cols
[2022-05-16 18:57:00] [INFO ] Computed 77 place invariants in 22 ms
[2022-05-16 18:57:00] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-16 18:57:00] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 12 ms returned sat
[2022-05-16 18:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:01] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-16 18:57:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-16 18:57:01] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 11 ms returned sat
[2022-05-16 18:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:01] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-05-16 18:57:01] [INFO ] Computed and/alt/rep : 272/1069/272 causal constraints (skipped 431 transitions) in 38 ms.
[2022-05-16 18:57:03] [INFO ] Added : 174 causal constraints over 35 iterations in 2023 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 741400 steps, including 1002 resets, run finished after 1144 ms. (steps per millisecond=648 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 720/720 transitions.
Applied a total of 0 rules in 11 ms. Remains 429 /429 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 720/720 transitions.
Starting structural reductions, iteration 0 : 429/429 places, 720/720 transitions.
Applied a total of 0 rules in 11 ms. Remains 429 /429 variables (removed 0) and now considering 720/720 (removed 0) transitions.
// Phase 1: matrix 720 rows 429 cols
[2022-05-16 18:57:04] [INFO ] Computed 77 place invariants in 36 ms
[2022-05-16 18:57:05] [INFO ] Implicit Places using invariants in 477 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 263, 274, 275, 276, 294, 296, 300, 318, 319, 320, 321, 333, 339, 345, 351, 357, 363, 369, 375, 381, 387, 393]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 481 ms to find 38 implicit places.
[2022-05-16 18:57:05] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 720 rows 391 cols
[2022-05-16 18:57:05] [INFO ] Computed 39 place invariants in 8 ms
[2022-05-16 18:57:05] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Starting structural reductions, iteration 1 : 391/429 places, 720/720 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 391 transition count 658
Reduce places removed 62 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 65 rules applied. Total rules applied 127 place count 329 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 328 transition count 655
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 128 place count 328 transition count 640
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 159 place count 312 transition count 640
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 308 transition count 632
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 179 place count 300 transition count 632
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 194 place count 285 transition count 617
Iterating global reduction 5 with 15 rules applied. Total rules applied 209 place count 285 transition count 617
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 285 transition count 614
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 285 transition count 613
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 284 transition count 613
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 217 place count 281 transition count 607
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 281 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 280 transition count 606
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 280 transition count 606
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 279 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 279 transition count 604
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 266 place count 258 transition count 583
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 268 place count 256 transition count 581
Iterating global reduction 6 with 2 rules applied. Total rules applied 270 place count 256 transition count 581
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 256 transition count 579
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 254 transition count 580
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 281 place count 254 transition count 575
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 248 transition count 575
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 248 transition count 575
Applied a total of 293 rules in 158 ms. Remains 248 /391 variables (removed 143) and now considering 575/720 (removed 145) transitions.
// Phase 1: matrix 575 rows 248 cols
[2022-05-16 18:57:05] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:57:06] [INFO ] Implicit Places using invariants in 274 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 275 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 236/429 places, 575/720 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 230 transition count 569
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 230 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 228 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 228 transition count 567
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 0 with 8 rules applied. Total rules applied 24 place count 224 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 224 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 218 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 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 40 place count 216 transition count 555
Applied a total of 40 rules in 74 ms. Remains 216 /236 variables (removed 20) and now considering 555/575 (removed 20) transitions.
// Phase 1: matrix 555 rows 216 cols
[2022-05-16 18:57:06] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 18:57:06] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 555 rows 216 cols
[2022-05-16 18:57:06] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 18:57:06] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 216/429 places, 555/720 transitions.
Successfully produced net in file /tmp/petri1000_9092562252667068739.dot
Successfully produced net in file /tmp/petri1001_3397658394095042729.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 553 rows 216 cols
[2022-05-16 18:57:06] [INFO ] Computed 21 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 25515 resets, run finished after 1321 ms. (steps per millisecond=757 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9679 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 216 cols
[2022-05-16 18:57:09] [INFO ] Computed 21 place invariants in 12 ms
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:09] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2022-05-16 18:57:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-16 18:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:09] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-05-16 18:57:09] [INFO ] Computed and/alt/rep : 95/561/95 causal constraints (skipped 441 transitions) in 43 ms.
[2022-05-16 18:57:09] [INFO ] Added : 9 causal constraints over 2 iterations in 185 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 33300 steps, including 1605 resets, run finished after 48 ms. (steps per millisecond=693 ) 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, 553/553 transitions.
Graph (complete) has 1361 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 214 transition count 553
Applied a total of 3 rules in 18 ms. Remains 214 /216 variables (removed 2) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/216 places, 553/553 transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:09] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25279 resets, run finished after 1606 ms. (steps per millisecond=622 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9594 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:12] [INFO ] Computed 21 place invariants in 18 ms
[2022-05-16 18:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:12] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-05-16 18:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-16 18:57:12] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 37 ms.
[2022-05-16 18:57:12] [INFO ] Added : 12 causal constraints over 3 iterations in 175 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 29400 steps, including 1003 resets, run finished after 62 ms. (steps per millisecond=474 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting structural reductions, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:13] [INFO ] Computed 21 place invariants in 10 ms
[2022-05-16 18:57:13] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:13] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 18:57:13] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2022-05-16 18:57:13] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:13] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 18:57:13] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-07
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:13] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 278 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:13] [INFO ] Computed 21 place invariants in 16 ms
[2022-05-16 18:57:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 18:57:13] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 18:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:14] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-16 18:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-16 18:57:14] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 26 ms.
[2022-05-16 18:57:14] [INFO ] Added : 12 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Incomplete Parikh walk after 29400 steps, including 1003 resets, run finished after 60 ms. (steps per millisecond=490 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 9 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:14] [INFO ] Computed 21 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 25497 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9677 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:16] [INFO ] Computed 21 place invariants in 12 ms
[2022-05-16 18:57:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:16] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-16 18:57:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 18:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:16] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-16 18:57:16] [INFO ] Computed and/alt/rep : 95/559/95 causal constraints (skipped 441 transitions) in 26 ms.
[2022-05-16 18:57:16] [INFO ] Added : 12 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Incomplete Parikh walk after 29400 steps, including 1003 resets, run finished after 36 ms. (steps per millisecond=816 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Starting structural reductions, iteration 0 : 214/214 places, 553/553 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 553/553 (removed 0) transitions.
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:17] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 18:57:17] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:17] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-16 18:57:17] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2022-05-16 18:57:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 553 rows 214 cols
[2022-05-16 18:57:17] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 18:57:17] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 1 iterations. Remains : 214/214 places, 553/553 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-07 in 3852 ms.
[2022-05-16 18:57:17] [INFO ] Flatten gal took : 104 ms
[2022-05-16 18:57:18] [INFO ] Applying decomposition
[2022-05-16 18:57:18] [INFO ] Flatten gal took : 52 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/graph582262414647556454.txt, -o, /tmp/graph582262414647556454.bin, -w, /tmp/graph582262414647556454.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/graph582262414647556454.bin, -l, -1, -v, -w, /tmp/graph582262414647556454.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 18:57:18] [INFO ] Decomposing Gal with order
[2022-05-16 18:57:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:57:18] [INFO ] Removed a total of 1147 redundant transitions.
[2022-05-16 18:57:18] [INFO ] Flatten gal took : 87 ms
[2022-05-16 18:57:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 14 ms.
[2022-05-16 18:57:18] [INFO ] Time to serialize gal into /tmp/UpperBounds17629785563141274309.gal : 6 ms
[2022-05-16 18:57:18] [INFO ] Time to serialize properties into /tmp/UpperBounds15436539519736872569.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/UpperBounds17629785563141274309.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15436539519736872569.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/UpperBounds17629785563141274309.gal -t CGAL -reachable-file /tmp/UpperBounds15436539519736872569.prop --nowitness
Loading property file /tmp/UpperBounds15436539519736872569.prop.
Detected timeout of ITS tools.
[2022-05-16 19:17:31] [INFO ] Applying decomposition
[2022-05-16 19:17:31] [INFO ] Flatten gal took : 60 ms
[2022-05-16 19:17:31] [INFO ] Decomposing Gal with order
[2022-05-16 19:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:17:31] [INFO ] Removed a total of 1026 redundant transitions.
[2022-05-16 19:17:31] [INFO ] Flatten gal took : 62 ms
[2022-05-16 19:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 22 ms.
[2022-05-16 19:17:32] [INFO ] Time to serialize gal into /tmp/UpperBounds10339649477124468921.gal : 9 ms
[2022-05-16 19:17:32] [INFO ] Time to serialize properties into /tmp/UpperBounds15900429474097640146.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/UpperBounds10339649477124468921.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15900429474097640146.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/UpperBounds10339649477124468921.gal -t CGAL -reachable-file /tmp/UpperBounds15900429474097640146.prop --nowitness
Loading property file /tmp/UpperBounds15900429474097640146.prop.
Detected timeout of ITS tools.
[2022-05-16 19:37:45] [INFO ] Flatten gal took : 45 ms
[2022-05-16 19:37:45] [INFO ] Input system was already deterministic with 553 transitions.
[2022-05-16 19:37:45] [INFO ] Transformed 214 places.
[2022-05-16 19:37:45] [INFO ] Transformed 553 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 19:37:45] [INFO ] Time to serialize gal into /tmp/UpperBounds13827268253551467880.gal : 3 ms
[2022-05-16 19:37:45] [INFO ] Time to serialize properties into /tmp/UpperBounds12201905349555066109.prop : 13 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/UpperBounds13827268253551467880.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12201905349555066109.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/UpperBounds13827268253551467880.gal -t CGAL -reachable-file /tmp/UpperBounds12201905349555066109.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/UpperBounds12201905349555066109.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="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ASLink-PT-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 r010-tajo-165245701500013"
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 ;