About the Execution of ITS-Tools for ASLink-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11905.575 | 3600000.00 | 3670476.00 | 4652.10 | 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600037.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813592600037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 417K Mar 5 18:22 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 1678485999849
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 22:06:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 22:06:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:06:42] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-10 22:06:42] [INFO ] Transformed 1242 places.
[2023-03-10 22:06:42] [INFO ] Transformed 1621 transitions.
[2023-03-10 22:06:42] [INFO ] Found NUPN structural information;
[2023-03-10 22:06:42] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2023-03-10 22:06:42] [INFO ] Computed 121 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :14
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-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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 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 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
[2023-03-10 22:06:42] [INFO ] Invariant cache hit.
[2023-03-10 22:06:42] [INFO ] [Real]Absence check using 27 positive place invariants in 51 ms returned sat
[2023-03-10 22:06:42] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 48 ms returned sat
[2023-03-10 22:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:06:43] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2023-03-10 22:06:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:06:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2023-03-10 22:06:44] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 33 ms returned sat
[2023-03-10 22:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:06:45] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2023-03-10 22:06:46] [INFO ] Deduced a trap composed of 42 places in 797 ms of which 18 ms to minimize.
[2023-03-10 22:06:47] [INFO ] Deduced a trap composed of 144 places in 720 ms of which 1 ms to minimize.
[2023-03-10 22:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2614 ms
[2023-03-10 22:06:48] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 146 ms.
[2023-03-10 22:06:49] [INFO ] Deduced a trap composed of 12 places in 670 ms of which 2 ms to minimize.
[2023-03-10 22:06:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:06:49] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2023-03-10 22:06:49] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 65 ms returned sat
[2023-03-10 22:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:06:50] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2023-03-10 22:06:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:06:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2023-03-10 22:06:51] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 39 ms returned sat
[2023-03-10 22:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:06:55] [INFO ] [Nat]Absence check using state equation in 4168 ms returned sat
[2023-03-10 22:06:56] [INFO ] Deduced a trap composed of 163 places in 689 ms of which 1 ms to minimize.
[2023-03-10 22:06:56] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1242 transition count 1340
Reduce places removed 281 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 295 rules applied. Total rules applied 576 place count 961 transition count 1326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 580 place count 957 transition count 1326
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 580 place count 957 transition count 1042
Deduced a syphon composed of 284 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 591 rules applied. Total rules applied 1171 place count 650 transition count 1042
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 20 rules applied. Total rules applied 1191 place count 647 transition count 1025
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1208 place count 630 transition count 1025
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1208 place count 630 transition count 1017
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 1232 place count 614 transition count 1017
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1232 place count 614 transition count 1009
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1248 place count 606 transition count 1009
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1286 place count 568 transition count 971
Iterating global reduction 5 with 38 rules applied. Total rules applied 1324 place count 568 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1325 place count 568 transition count 970
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1325 place count 568 transition count 956
Deduced a syphon composed of 14 places in 3 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 1354 place count 553 transition count 956
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1354 place count 553 transition count 955
Deduced a syphon composed of 1 places in 3 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 1357 place count 551 transition count 955
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1360 place count 548 transition count 934
Iterating global reduction 6 with 3 rules applied. Total rules applied 1363 place count 548 transition count 934
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1363 place count 548 transition count 932
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1367 place count 546 transition count 932
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 545 transition count 924
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 545 transition count 924
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 544 transition count 916
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 544 transition count 916
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 543 transition count 908
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 543 transition count 908
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 542 transition count 900
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 542 transition count 900
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 541 transition count 892
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 541 transition count 892
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 540 transition count 884
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 540 transition count 884
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 539 transition count 876
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 539 transition count 876
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 538 transition count 868
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 538 transition count 868
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 537 transition count 860
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 537 transition count 860
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1386 place count 536 transition count 852
Iterating global reduction 6 with 1 rules applied. Total rules applied 1387 place count 536 transition count 852
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 535 transition count 844
Iterating global reduction 6 with 1 rules applied. Total rules applied 1389 place count 535 transition count 844
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1390 place count 534 transition count 836
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 534 transition count 836
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1392 place count 533 transition count 828
Iterating global reduction 6 with 1 rules applied. Total rules applied 1393 place count 533 transition count 828
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1394 place count 532 transition count 820
Iterating global reduction 6 with 1 rules applied. Total rules applied 1395 place count 532 transition count 820
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1396 place count 531 transition count 812
Iterating global reduction 6 with 1 rules applied. Total rules applied 1397 place count 531 transition count 812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1398 place count 530 transition count 804
Iterating global reduction 6 with 1 rules applied. Total rules applied 1399 place count 530 transition count 804
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 1529 place count 465 transition count 739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1530 place count 464 transition count 738
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1532 place count 463 transition count 738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1533 place count 462 transition count 737
Iterating global reduction 6 with 1 rules applied. Total rules applied 1534 place count 462 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 1536 place count 462 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1537 place count 461 transition count 735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1539 place count 460 transition count 744
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1542 place count 460 transition count 741
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1545 place count 457 transition count 741
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1546 place count 457 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1547 place count 456 transition count 740
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1548 place count 455 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 1554 place count 451 transition count 737
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1556 place count 449 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 1556 place count 449 transition count 731
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 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 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 1581 place count 435 transition count 726
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1583 place count 433 transition count 724
Iterating global reduction 13 with 2 rules applied. Total rules applied 1585 place count 433 transition count 724
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1587 place count 433 transition count 722
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1589 place count 431 transition count 722
Applied a total of 1589 rules in 669 ms. Remains 431 /1242 variables (removed 811) and now considering 722/1621 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 669 ms. Remains : 431/1242 places, 722/1621 transitions.
// Phase 1: matrix 722 rows 431 cols
[2023-03-10 22:06:56] [INFO ] Computed 77 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 16245 resets, run finished after 1849 ms. (steps per millisecond=540 ) properties (out of 2) seen :1
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5586 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 1) seen :0
[2023-03-10 22:06:59] [INFO ] Invariant cache hit.
[2023-03-10 22:06:59] [INFO ] [Real]Absence check using 19 positive place invariants in 38 ms returned sat
[2023-03-10 22:06:59] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 13 ms returned sat
[2023-03-10 22:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:00] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-10 22:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-10 22:07:00] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 13 ms returned sat
[2023-03-10 22:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:00] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-10 22:07:00] [INFO ] Computed and/alt/rep : 274/1071/274 causal constraints (skipped 431 transitions) in 75 ms.
[2023-03-10 22:07:02] [INFO ] Added : 111 causal constraints over 23 iterations in 1556 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 722/722 transitions.
Applied a total of 0 rules in 11 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 431/431 places, 722/722 transitions.
[2023-03-10 22:07:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16047 resets, run finished after 1718 ms. (steps per millisecond=582 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5527 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 1) seen :0
[2023-03-10 22:07:05] [INFO ] Invariant cache hit.
[2023-03-10 22:07:05] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-10 22:07:05] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 27 ms returned sat
[2023-03-10 22:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:05] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-10 22:07:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-10 22:07:05] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 27 ms returned sat
[2023-03-10 22:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:06] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-10 22:07:06] [INFO ] Computed and/alt/rep : 274/1071/274 causal constraints (skipped 431 transitions) in 72 ms.
[2023-03-10 22:07:07] [INFO ] Added : 111 causal constraints over 23 iterations in 1660 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 722/722 transitions.
Applied a total of 0 rules in 10 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 431/431 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 722/722 transitions.
Applied a total of 0 rules in 10 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-10 22:07:08] [INFO ] Invariant cache hit.
[2023-03-10 22:07:08] [INFO ] Implicit Places using invariants in 279 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 150, 151, 153, 170, 188, 257, 261, 262, 265, 276, 277, 278, 296, 298, 302, 320, 321, 322, 323, 335, 341, 347, 353, 359, 365, 371, 377, 383, 389, 395]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 282 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 393/431 places, 722/722 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 393 transition count 658
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 329 transition count 656
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 130 place count 329 transition count 641
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 2 with 31 rules applied. Total rules applied 161 place count 313 transition count 641
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 173 place count 309 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 301 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 286 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 286 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 286 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 286 transition count 614
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 285 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 282 transition count 608
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 282 transition count 608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 281 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 281 transition count 607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 280 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 280 transition count 605
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 5 with 42 rules applied. Total rules applied 268 place count 259 transition count 584
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 257 transition count 582
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 257 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 257 transition count 580
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 6 with 4 rules applied. Total rules applied 278 place count 255 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 282 place count 255 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 287 place count 250 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 293 place count 250 transition count 577
Applied a total of 293 rules in 73 ms. Remains 250 /393 variables (removed 143) and now considering 577/722 (removed 145) transitions.
// Phase 1: matrix 577 rows 250 cols
[2023-03-10 22:07:08] [INFO ] Computed 33 place invariants in 14 ms
[2023-03-10 22:07:09] [INFO ] Implicit Places using invariants in 361 ms returned [72, 89, 95, 98, 100, 105, 106, 158, 175, 181, 184, 186]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 363 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/431 places, 577/722 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 232 transition count 571
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 230 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 230 transition count 569
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 226 transition count 565
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 559
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 220 transition count 559
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 220 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 218 transition count 557
Applied a total of 40 rules in 38 ms. Remains 218 /238 variables (removed 20) and now considering 557/577 (removed 20) transitions.
// Phase 1: matrix 557 rows 218 cols
[2023-03-10 22:07:09] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-10 22:07:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-10 22:07:09] [INFO ] Invariant cache hit.
[2023-03-10 22:07:09] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/431 places, 557/722 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1304 ms. Remains : 218/431 places, 557/722 transitions.
Successfully produced net in file /tmp/petri1000_8887095373602971435.dot
Successfully produced net in file /tmp/petri1001_17391815711124852016.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 555 rows 218 cols
[2023-03-10 22:07:09] [INFO ] Computed 21 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 25454 resets, run finished after 1474 ms. (steps per millisecond=678 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9613 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :0
[2023-03-10 22:07:11] [INFO ] Invariant cache hit.
[2023-03-10 22:07:11] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 22:07:11] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 16 ms returned sat
[2023-03-10 22:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:12] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-10 22:07:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2023-03-10 22:07:12] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 22:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:12] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-10 22:07:12] [INFO ] Computed and/alt/rep : 97/563/97 causal constraints (skipped 441 transitions) in 32 ms.
[2023-03-10 22:07:13] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 12 ms to minimize.
[2023-03-10 22:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-10 22:07:13] [INFO ] Added : 38 causal constraints over 10 iterations in 935 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 555/555 transitions.
Graph (complete) has 1363 edges and 218 vertex of which 216 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 216 transition count 555
Applied a total of 3 rules in 26 ms. Remains 216 /218 variables (removed 2) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 216/218 places, 555/555 transitions.
// Phase 1: matrix 555 rows 216 cols
[2023-03-10 22:07:13] [INFO ] Computed 21 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 25584 resets, run finished after 1491 ms. (steps per millisecond=670 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9689 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 1) seen :0
[2023-03-10 22:07:15] [INFO ] Invariant cache hit.
[2023-03-10 22:07:16] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-10 22:07:16] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 17 ms returned sat
[2023-03-10 22:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:16] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-10 22:07:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:07:16] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-10 22:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:16] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-10 22:07:16] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 74 ms.
[2023-03-10 22:07:17] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-10 22:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-10 22:07:17] [INFO ] Added : 28 causal constraints over 6 iterations in 770 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-10 22:07:17] [INFO ] Invariant cache hit.
[2023-03-10 22:07:17] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 22:07:17] [INFO ] Invariant cache hit.
[2023-03-10 22:07:18] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-10 22:07:18] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-10 22:07:18] [INFO ] Invariant cache hit.
[2023-03-10 22:07:18] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 216/216 places, 555/555 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-10
[2023-03-10 22:07:18] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 22:07:18] [INFO ] Invariant cache hit.
[2023-03-10 22:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-10 22:07:18] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 22:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:18] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-10 22:07:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:07:18] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 22:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:19] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-10 22:07:19] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 62 ms.
[2023-03-10 22:07:19] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2023-03-10 22:07:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-10 22:07:19] [INFO ] Added : 28 causal constraints over 6 iterations in 694 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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 REACHABILITY mode , in 1 iterations and 6 ms. Remains : 216/216 places, 555/555 transitions.
[2023-03-10 22:07:20] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 25602 resets, run finished after 1378 ms. (steps per millisecond=725 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9584 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 1) seen :0
[2023-03-10 22:07:22] [INFO ] Invariant cache hit.
[2023-03-10 22:07:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:22] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-10 22:07:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:07:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:07:22] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-10 22:07:22] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 40 ms.
[2023-03-10 22:07:23] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2023-03-10 22:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-10 22:07:23] [INFO ] Added : 28 causal constraints over 6 iterations in 666 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 216/216 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 19 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-10 22:07:23] [INFO ] Invariant cache hit.
[2023-03-10 22:07:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-10 22:07:23] [INFO ] Invariant cache hit.
[2023-03-10 22:07:24] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-10 22:07:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 22:07:24] [INFO ] Invariant cache hit.
[2023-03-10 22:07:24] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 953 ms. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-10 in 6050 ms.
[2023-03-10 22:07:24] [INFO ] Flatten gal took : 87 ms
[2023-03-10 22:07:24] [INFO ] Applying decomposition
[2023-03-10 22:07:24] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2434974920556570035.txt' '-o' '/tmp/graph2434974920556570035.bin' '-w' '/tmp/graph2434974920556570035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2434974920556570035.bin' '-l' '-1' '-v' '-w' '/tmp/graph2434974920556570035.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:07:25] [INFO ] Decomposing Gal with order
[2023-03-10 22:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:07:25] [INFO ] Removed a total of 1155 redundant transitions.
[2023-03-10 22:07:25] [INFO ] Flatten gal took : 90 ms
[2023-03-10 22:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 13 ms.
[2023-03-10 22:07:25] [INFO ] Time to serialize gal into /tmp/UpperBounds6607244110602524778.gal : 7 ms
[2023-03-10 22:07:25] [INFO ] Time to serialize properties into /tmp/UpperBounds2019454409124776421.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6607244110602524778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2019454409124776421.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds2019454409124776421.prop.
Detected timeout of ITS tools.
[2023-03-10 22:27:39] [INFO ] Applying decomposition
[2023-03-10 22:27:39] [INFO ] Flatten gal took : 56 ms
[2023-03-10 22:27:39] [INFO ] Decomposing Gal with order
[2023-03-10 22:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:27:39] [INFO ] Removed a total of 1026 redundant transitions.
[2023-03-10 22:27:39] [INFO ] Flatten gal took : 62 ms
[2023-03-10 22:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 10 ms.
[2023-03-10 22:27:39] [INFO ] Time to serialize gal into /tmp/UpperBounds16314563355731592949.gal : 3 ms
[2023-03-10 22:27:39] [INFO ] Time to serialize properties into /tmp/UpperBounds7000126236048287827.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16314563355731592949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7000126236048287827.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds7000126236048287827.prop.
Detected timeout of ITS tools.
[2023-03-10 22:47:54] [INFO ] Flatten gal took : 23 ms
[2023-03-10 22:47:54] [INFO ] Input system was already deterministic with 555 transitions.
[2023-03-10 22:47:54] [INFO ] Transformed 216 places.
[2023-03-10 22:47:54] [INFO ] Transformed 555 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 22:47:54] [INFO ] Time to serialize gal into /tmp/UpperBounds6361781981420588551.gal : 10 ms
[2023-03-10 22:47:54] [INFO ] Time to serialize properties into /tmp/UpperBounds16900557073089874708.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6361781981420588551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16900557073089874708.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16900557073089874708.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4234860 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097416 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-5348"
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 r005-oct2-167813592600037"
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 '
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 ;