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.r011-oct2-167813599600037.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 smartxred
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 r011-oct2-167813599600037
=====================================================================

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

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 14:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 14:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:53:40] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-13 14:53:40] [INFO ] Transformed 1242 places.
[2023-03-13 14:53:40] [INFO ] Transformed 1621 transitions.
[2023-03-13 14:53:40] [INFO ] Found NUPN structural information;
[2023-03-13 14:53:40] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
// Phase 1: matrix 1621 rows 1242 cols
[2023-03-13 14:53:40] [INFO ] Computed 121 place invariants in 120 ms
Incomplete random walk after 10000 steps, including 36 resets, run finished after 102 ms. (steps per millisecond=98 ) 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-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-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 10001 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :1
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
[2023-03-13 14:53:41] [INFO ] Invariant cache hit.
[2023-03-13 14:53:42] [INFO ] [Real]Absence check using 27 positive place invariants in 168 ms returned sat
[2023-03-13 14:53:42] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 47 ms returned sat
[2023-03-13 14:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:53:43] [INFO ] [Real]Absence check using state equation in 1478 ms returned sat
[2023-03-13 14:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:53:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2023-03-13 14:53:44] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 36 ms returned sat
[2023-03-13 14:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:53:48] [INFO ] [Nat]Absence check using state equation in 4320 ms returned sat
[2023-03-13 14:53:49] [INFO ] Deduced a trap composed of 26 places in 581 ms of which 4 ms to minimize.
[2023-03-13 14:53: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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 14:53:49] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned sat
[2023-03-13 14:53:49] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 92 ms returned sat
[2023-03-13 14:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:53:50] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2023-03-13 14:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:53:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 34 ms returned sat
[2023-03-13 14:53:51] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 45 ms returned sat
[2023-03-13 14:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:53:55] [INFO ] [Nat]Absence check using state equation in 4353 ms returned sat
[2023-03-13 14:53:56] [INFO ] Deduced a trap composed of 163 places in 431 ms of which 2 ms to minimize.
[2023-03-13 14:53: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 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 580 place count 957 transition count 1043
Deduced a syphon composed of 283 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1168 place count 652 transition count 1043
Discarding 4 places :
Implicit places reduction removed 4 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 20 rules applied. Total rules applied 1188 place count 648 transition count 1027
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1204 place count 632 transition count 1027
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1204 place count 632 transition count 1019
Deduced a syphon composed of 8 places in 3 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 1228 place count 616 transition count 1019
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1228 place count 616 transition count 1011
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 1244 place count 608 transition count 1011
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1282 place count 570 transition count 973
Iterating global reduction 5 with 38 rules applied. Total rules applied 1320 place count 570 transition count 973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1321 place count 570 transition count 972
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1321 place count 570 transition count 958
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 1350 place count 555 transition count 958
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1350 place count 555 transition count 957
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 1353 place count 553 transition count 957
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1356 place count 550 transition count 936
Iterating global reduction 6 with 3 rules applied. Total rules applied 1359 place count 550 transition count 936
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1359 place count 550 transition count 934
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1363 place count 548 transition count 934
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1364 place count 547 transition count 926
Iterating global reduction 6 with 1 rules applied. Total rules applied 1365 place count 547 transition count 926
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1366 place count 546 transition count 918
Iterating global reduction 6 with 1 rules applied. Total rules applied 1367 place count 546 transition count 918
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 545 transition count 910
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 545 transition count 910
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 544 transition count 902
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 544 transition count 902
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 543 transition count 894
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 543 transition count 894
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 542 transition count 886
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 542 transition count 886
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 541 transition count 878
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 541 transition count 878
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 540 transition count 870
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 540 transition count 870
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 539 transition count 862
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 539 transition count 862
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 538 transition count 854
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 538 transition count 854
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 537 transition count 846
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 537 transition count 846
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1386 place count 536 transition count 838
Iterating global reduction 6 with 1 rules applied. Total rules applied 1387 place count 536 transition count 838
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 535 transition count 830
Iterating global reduction 6 with 1 rules applied. Total rules applied 1389 place count 535 transition count 830
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1390 place count 534 transition count 822
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 534 transition count 822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1392 place count 533 transition count 814
Iterating global reduction 6 with 1 rules applied. Total rules applied 1393 place count 533 transition count 814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1394 place count 532 transition count 806
Iterating global reduction 6 with 1 rules applied. Total rules applied 1395 place count 532 transition count 806
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 1525 place count 467 transition count 741
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1526 place count 466 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1528 place count 465 transition count 740
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1529 place count 464 transition count 739
Iterating global reduction 6 with 1 rules applied. Total rules applied 1530 place count 464 transition count 739
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 1532 place count 464 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1533 place count 463 transition count 737
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 1535 place count 462 transition count 746
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1538 place count 462 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1541 place count 459 transition count 743
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1543 place count 459 transition count 741
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1545 place count 457 transition count 741
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1546 place count 456 transition count 740
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 453 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1551 place count 452 transition count 739
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 5 Pre rules applied. Total rules applied 1551 place count 452 transition count 734
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1561 place count 447 transition count 734
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 1563 place count 445 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1563 place count 445 transition count 733
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 1565 place count 444 transition count 733
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 1571 place count 441 transition count 730
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1572 place count 440 transition count 729
Iterating global reduction 13 with 1 rules applied. Total rules applied 1573 place count 440 transition count 729
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1574 place count 440 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1575 place count 439 transition count 728
Applied a total of 1575 rules in 674 ms. Remains 439 /1242 variables (removed 803) and now considering 728/1621 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 674 ms. Remains : 439/1242 places, 728/1621 transitions.
// Phase 1: matrix 728 rows 439 cols
[2023-03-13 14:53:56] [INFO ] Computed 79 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 17071 resets, run finished after 2065 ms. (steps per millisecond=484 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5833 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5885 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 2) seen :1
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 14:54:00] [INFO ] Invariant cache hit.
[2023-03-13 14:54:00] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-13 14:54:00] [INFO ] [Real]Absence check using 21 positive and 58 generalized place invariants in 22 ms returned sat
[2023-03-13 14:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:01] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-03-13 14:54:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-13 14:54:01] [INFO ] [Nat]Absence check using 21 positive and 58 generalized place invariants in 19 ms returned sat
[2023-03-13 14:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:01] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-13 14:54:01] [INFO ] Computed and/alt/rep : 279/1086/279 causal constraints (skipped 431 transitions) in 73 ms.
[2023-03-13 14:54:04] [INFO ] Added : 149 causal constraints over 30 iterations in 2567 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 728/728 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 727
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 437 transition count 727
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 437 transition count 726
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 436 transition count 726
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 435 transition count 726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 433 transition count 724
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 432 transition count 723
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 432 transition count 723
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 432 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 431 transition count 722
Applied a total of 14 rules in 43 ms. Remains 431 /439 variables (removed 8) and now considering 722/728 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 431/439 places, 722/728 transitions.
// Phase 1: matrix 722 rows 431 cols
[2023-03-13 14:54:05] [INFO ] Computed 77 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16296 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5520 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 1) seen :0
[2023-03-13 14:54:07] [INFO ] Invariant cache hit.
[2023-03-13 14:54:07] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-13 14:54:08] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 70 ms returned sat
[2023-03-13 14:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:08] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-13 14:54:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-13 14:54:08] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 13 ms returned sat
[2023-03-13 14:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:09] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-13 14:54:09] [INFO ] Computed and/alt/rep : 274/1071/274 causal constraints (skipped 431 transitions) in 81 ms.
[2023-03-13 14:54:10] [INFO ] Added : 78 causal constraints over 16 iterations in 1294 ms. Result :sat
Minimization took 186 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 15 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 15 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 12 ms. Remains 431 /431 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-13 14:54:12] [INFO ] Invariant cache hit.
[2023-03-13 14:54:12] [INFO ] Implicit Places using invariants in 419 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 424 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 0 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 80 ms. Remains 250 /393 variables (removed 143) and now considering 577/722 (removed 145) transitions.
// Phase 1: matrix 577 rows 250 cols
[2023-03-13 14:54:12] [INFO ] Computed 33 place invariants in 8 ms
[2023-03-13 14:54:13] [INFO ] Implicit Places using invariants in 198 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 200 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 0 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 28 ms. Remains 218 /238 variables (removed 20) and now considering 557/577 (removed 20) transitions.
// Phase 1: matrix 557 rows 218 cols
[2023-03-13 14:54:13] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-13 14:54:13] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-13 14:54:13] [INFO ] Invariant cache hit.
[2023-03-13 14:54:13] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 826 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 1570 ms. Remains : 218/431 places, 557/722 transitions.
Successfully produced net in file /tmp/petri1000_743280706580625826.dot
Successfully produced net in file /tmp/petri1001_4748133745925184412.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 555 rows 218 cols
[2023-03-13 14:54:14] [INFO ] Computed 21 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 25391 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9686 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :0
[2023-03-13 14:54:16] [INFO ] Invariant cache hit.
[2023-03-13 14:54:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 14:54:16] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-13 14:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:16] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-13 14:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 14:54:16] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-13 14:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:16] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-13 14:54:17] [INFO ] Computed and/alt/rep : 97/563/97 causal constraints (skipped 441 transitions) in 48 ms.
[2023-03-13 14:54:18] [INFO ] Added : 33 causal constraints over 8 iterations in 1323 ms. Result :sat
Minimization took 96 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 22 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 22 ms. Remains : 216/218 places, 555/555 transitions.
// Phase 1: matrix 555 rows 216 cols
[2023-03-13 14:54:18] [INFO ] Computed 21 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 25618 resets, run finished after 1433 ms. (steps per millisecond=697 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9615 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :0
[2023-03-13 14:54:20] [INFO ] Invariant cache hit.
[2023-03-13 14:54:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 14:54:20] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-13 14:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:21] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-13 14:54:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 14:54:21] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-13 14:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:21] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-13 14:54:21] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 71 ms.
[2023-03-13 14:54:22] [INFO ] Added : 42 causal constraints over 9 iterations in 653 ms. Result :sat
Minimization took 130 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-13 14:54:22] [INFO ] Invariant cache hit.
[2023-03-13 14:54:22] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-13 14:54:22] [INFO ] Invariant cache hit.
[2023-03-13 14:54:23] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-13 14:54:23] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-13 14:54:23] [INFO ] Invariant cache hit.
[2023-03-13 14:54:23] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1491 ms. Remains : 216/216 places, 555/555 transitions.
Starting property specific reduction for ASLink-PT-02b-UpperBounds-10
[2023-03-13 14:54:23] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 14:54:23] [INFO ] Invariant cache hit.
[2023-03-13 14:54:24] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:54:24] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-13 14:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:24] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-13 14:54:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:54:24] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-13 14:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:24] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-13 14:54:24] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 56 ms.
[2023-03-13 14:54:25] [INFO ] Added : 42 causal constraints over 9 iterations in 592 ms. Result :sat
Minimization took 93 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.
[2023-03-13 14:54:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 25594 resets, run finished after 1433 ms. (steps per millisecond=697 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9626 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
[2023-03-13 14:54:27] [INFO ] Invariant cache hit.
[2023-03-13 14:54:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 14:54:27] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-13 14:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:27] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-13 14:54:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:54:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 40 ms returned sat
[2023-03-13 14:54:27] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-13 14:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:54:28] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-13 14:54:28] [INFO ] Computed and/alt/rep : 97/561/97 causal constraints (skipped 441 transitions) in 61 ms.
[2023-03-13 14:54:29] [INFO ] Added : 42 causal constraints over 9 iterations in 642 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 5 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 555/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-13 14:54:29] [INFO ] Invariant cache hit.
[2023-03-13 14:54:29] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-13 14:54:29] [INFO ] Invariant cache hit.
[2023-03-13 14:54:30] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-13 14:54:30] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 14:54:30] [INFO ] Invariant cache hit.
[2023-03-13 14:54:30] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1322 ms. Remains : 216/216 places, 555/555 transitions.
Ending property specific reduction for ASLink-PT-02b-UpperBounds-10 in 6632 ms.
[2023-03-13 14:54:31] [INFO ] Flatten gal took : 114 ms
[2023-03-13 14:54:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 14:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 216 places, 555 transitions and 2272 arcs took 3 ms.
Total runtime 50787 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 02b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 216 places, 555 transitions, 2272 arcs.
Final Score: 7396.914
Took : 26 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7129900 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16103476 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="smartxred"
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 smartxred"
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 r011-oct2-167813599600037"
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 ;