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.r009-oct2-167813597500134.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 ltsminxred
Input is ASLink-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 1.2M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678614771695

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:52:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:52:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:52:54] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2023-03-12 09:52:54] [INFO ] Transformed 3618 places.
[2023-03-12 09:52:54] [INFO ] Transformed 4459 transitions.
[2023-03-12 09:52:54] [INFO ] Found NUPN structural information;
[2023-03-12 09:52:54] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-08b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 13) seen :5
FORMULA ASLink-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :1
FORMULA ASLink-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4459 rows 3618 cols
[2023-03-12 09:52:56] [INFO ] Computed 355 place invariants in 171 ms
[2023-03-12 09:52:58] [INFO ] [Real]Absence check using 83 positive place invariants in 57 ms returned sat
[2023-03-12 09:52:58] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 440 ms returned sat
[2023-03-12 09:52:58] [INFO ] After 2304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 09:53:00] [INFO ] [Nat]Absence check using 83 positive place invariants in 73 ms returned sat
[2023-03-12 09:53:00] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 454 ms returned sat
[2023-03-12 09:53:23] [INFO ] After 22665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:53:23] [INFO ] After 22673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 09:53:23] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 139 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions removed 763 transitions
Trivial Post-agglo rules discarded 763 transitions
Performed 763 trivial Post agglomeration. Transition count delta: 763
Iterating post reduction 0 with 763 rules applied. Total rules applied 763 place count 3618 transition count 3696
Reduce places removed 763 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 796 rules applied. Total rules applied 1559 place count 2855 transition count 3663
Reduce places removed 7 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 31 rules applied. Total rules applied 1590 place count 2848 transition count 3639
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1614 place count 2824 transition count 3639
Performed 782 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 782 Pre rules applied. Total rules applied 1614 place count 2824 transition count 2857
Deduced a syphon composed of 782 places in 8 ms
Ensure Unique test removed 62 places
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 4 with 1626 rules applied. Total rules applied 3240 place count 1980 transition count 2857
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 57 rules applied. Total rules applied 3297 place count 1963 transition count 2817
Reduce places removed 40 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 45 rules applied. Total rules applied 3342 place count 1923 transition count 2812
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3347 place count 1918 transition count 2812
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3347 place count 1918 transition count 2791
Deduced a syphon composed of 21 places in 19 ms
Ensure Unique test removed 19 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 61 rules applied. Total rules applied 3408 place count 1878 transition count 2791
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 3409 place count 1877 transition count 2791
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 3409 place count 1877 transition count 2771
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 3449 place count 1857 transition count 2771
Discarding 107 places :
Symmetric choice reduction at 8 with 107 rule applications. Total rules 3556 place count 1750 transition count 2664
Iterating global reduction 8 with 107 rules applied. Total rules applied 3663 place count 1750 transition count 2664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3664 place count 1750 transition count 2663
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 31 Pre rules applied. Total rules applied 3664 place count 1750 transition count 2632
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 9 with 62 rules applied. Total rules applied 3726 place count 1719 transition count 2632
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3732 place count 1713 transition count 2593
Iterating global reduction 9 with 6 rules applied. Total rules applied 3738 place count 1713 transition count 2593
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 3738 place count 1713 transition count 2589
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3746 place count 1709 transition count 2589
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3747 place count 1708 transition count 2581
Iterating global reduction 9 with 1 rules applied. Total rules applied 3748 place count 1708 transition count 2581
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 13 ms
Ensure Unique test removed 7 places
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 9 with 447 rules applied. Total rules applied 4195 place count 1481 transition count 2361
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4196 place count 1480 transition count 2360
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 4198 place count 1479 transition count 2360
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4199 place count 1478 transition count 2359
Iterating global reduction 9 with 1 rules applied. Total rules applied 4200 place count 1478 transition count 2359
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 9 with 2 rules applied. Total rules applied 4202 place count 1478 transition count 2357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4203 place count 1477 transition count 2357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4205 place count 1476 transition count 2366
Free-agglomeration rule applied 15 times.
Iterating global reduction 11 with 15 rules applied. Total rules applied 4220 place count 1476 transition count 2351
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 4235 place count 1461 transition count 2351
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 12 with 15 rules applied. Total rules applied 4250 place count 1461 transition count 2336
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 4265 place count 1446 transition count 2336
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 4268 place count 1446 transition count 2336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4269 place count 1445 transition count 2335
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 7 rules applied. Total rules applied 4276 place count 1440 transition count 2333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 4278 place count 1438 transition count 2333
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 8 Pre rules applied. Total rules applied 4278 place count 1438 transition count 2325
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 4294 place count 1430 transition count 2325
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 15 with 2 rules applied. Total rules applied 4296 place count 1428 transition count 2325
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4304 place count 1424 transition count 2321
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 4305 place count 1424 transition count 2320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 4306 place count 1423 transition count 2320
Applied a total of 4306 rules in 2508 ms. Remains 1423 /3618 variables (removed 2195) and now considering 2320/4459 (removed 2139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2509 ms. Remains : 1423/3618 places, 2320/4459 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 7) seen :1
FORMULA ASLink-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :1
FORMULA ASLink-PT-08b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2320 rows 1423 cols
[2023-03-12 09:53:27] [INFO ] Computed 241 place invariants in 40 ms
[2023-03-12 09:53:27] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned sat
[2023-03-12 09:53:27] [INFO ] [Real]Absence check using 58 positive and 183 generalized place invariants in 73 ms returned sat
[2023-03-12 09:53:27] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:53:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 61 ms returned sat
[2023-03-12 09:53:27] [INFO ] [Nat]Absence check using 58 positive and 183 generalized place invariants in 80 ms returned sat
[2023-03-12 09:53:40] [INFO ] After 11915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:53:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 09:53:48] [INFO ] After 8402ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 09:53:49] [INFO ] Deduced a trap composed of 54 places in 1127 ms of which 29 ms to minimize.
[2023-03-12 09:53:50] [INFO ] Deduced a trap composed of 26 places in 890 ms of which 2 ms to minimize.
[2023-03-12 09:53:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2315 ms
[2023-03-12 09:53:51] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 1 ms to minimize.
[2023-03-12 09:53:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-12 09:53:52] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-12 09:53:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 09:53:52] [INFO ] After 25308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 513 ms.
Support contains 116 out of 1423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1423/1423 places, 2320/2320 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1423 transition count 2312
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1415 transition count 2312
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 1415 transition count 2301
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 42 place count 1400 transition count 2301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 42 place count 1400 transition count 2300
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1399 transition count 2300
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 61 place count 1390 transition count 2292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 1389 transition count 2289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 1387 transition count 2289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 1387 transition count 2288
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 1386 transition count 2288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 1385 transition count 2287
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 1385 transition count 2286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 1384 transition count 2286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 1384 transition count 2285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 1383 transition count 2285
Applied a total of 75 rules in 290 ms. Remains 1383 /1423 variables (removed 40) and now considering 2285/2320 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 1383/1423 places, 2285/2320 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :1
FORMULA ASLink-PT-08b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2285 rows 1383 cols
[2023-03-12 09:53:53] [INFO ] Computed 234 place invariants in 20 ms
[2023-03-12 09:53:54] [INFO ] [Real]Absence check using 54 positive place invariants in 19 ms returned sat
[2023-03-12 09:53:54] [INFO ] [Real]Absence check using 54 positive and 180 generalized place invariants in 92 ms returned sat
[2023-03-12 09:53:54] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 09:53:54] [INFO ] [Nat]Absence check using 54 positive place invariants in 27 ms returned sat
[2023-03-12 09:53:54] [INFO ] [Nat]Absence check using 54 positive and 180 generalized place invariants in 121 ms returned sat
[2023-03-12 09:53:58] [INFO ] After 2994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:53:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 09:54:07] [INFO ] After 9765ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:54:08] [INFO ] After 10431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-12 09:54:08] [INFO ] After 14557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 196 ms.
Support contains 65 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 2285/2285 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1383 transition count 2273
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 1369 transition count 2273
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 26 place count 1369 transition count 2243
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 90 place count 1335 transition count 2243
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 1332 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 1331 transition count 2237
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 1331 transition count 2237
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 1330 transition count 2237
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 124 place count 1316 transition count 2223
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 1312 transition count 2212
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 1312 transition count 2212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 1310 transition count 2203
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 1310 transition count 2203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 1310 transition count 2202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 1309 transition count 2194
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 1309 transition count 2194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 1308 transition count 2186
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 1308 transition count 2186
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 1307 transition count 2178
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 1307 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 1306 transition count 2170
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 1306 transition count 2170
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 1305 transition count 2162
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 1305 transition count 2162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 1304 transition count 2154
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 1304 transition count 2154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 1303 transition count 2146
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 1303 transition count 2146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 1302 transition count 2138
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 1302 transition count 2138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 1301 transition count 2130
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 1301 transition count 2130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 1300 transition count 2122
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 1300 transition count 2122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 158 place count 1299 transition count 2114
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 1299 transition count 2114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 1298 transition count 2106
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 1298 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 1297 transition count 2098
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 1297 transition count 2098
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 1297 transition count 2095
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 1294 transition count 2095
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 1294 transition count 2095
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 173 place count 1291 transition count 2092
Reduce places removed 4 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 6 with 5 rules applied. Total rules applied 178 place count 1287 transition count 2091
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 179 place count 1286 transition count 2091
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 179 place count 1286 transition count 2084
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 193 place count 1279 transition count 2084
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 195 place count 1277 transition count 2084
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 201 place count 1274 transition count 2081
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 203 place count 1272 transition count 2079
Iterating global reduction 9 with 2 rules applied. Total rules applied 205 place count 1272 transition count 2079
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 207 place count 1272 transition count 2077
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 209 place count 1270 transition count 2077
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 210 place count 1270 transition count 2077
Applied a total of 210 rules in 1228 ms. Remains 1270 /1383 variables (removed 113) and now considering 2077/2285 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1228 ms. Remains : 1270/1383 places, 2077/2285 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 171116 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171116 steps, saw 37896 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2077 rows 1270 cols
[2023-03-12 09:54:13] [INFO ] Computed 218 place invariants in 18 ms
[2023-03-12 09:54:13] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-12 09:54:14] [INFO ] [Real]Absence check using 50 positive and 168 generalized place invariants in 151 ms returned sat
[2023-03-12 09:54:14] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 09:54:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2023-03-12 09:54:14] [INFO ] [Nat]Absence check using 50 positive and 168 generalized place invariants in 114 ms returned sat
[2023-03-12 09:54:26] [INFO ] After 11414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:54:26] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 0 ms to minimize.
[2023-03-12 09:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 652 ms
[2023-03-12 09:54:27] [INFO ] After 12593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 371 ms.
[2023-03-12 09:54:27] [INFO ] After 13554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 65 out of 1270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1270/1270 places, 2077/2077 transitions.
Applied a total of 0 rules in 42 ms. Remains 1270 /1270 variables (removed 0) and now considering 2077/2077 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1270/1270 places, 2077/2077 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1270/1270 places, 2077/2077 transitions.
Applied a total of 0 rules in 39 ms. Remains 1270 /1270 variables (removed 0) and now considering 2077/2077 (removed 0) transitions.
[2023-03-12 09:54:27] [INFO ] Invariant cache hit.
[2023-03-12 09:54:29] [INFO ] Implicit Places using invariants in 1387 ms returned [1, 19, 20, 51, 69, 89, 122, 148, 149, 150, 155, 165, 166, 187, 206, 245, 273, 282, 292, 303, 304, 306, 323, 342, 419, 423, 424, 435, 436, 438, 455, 474, 514, 543, 544, 558, 562, 563, 575, 576, 578, 597, 615, 693, 707, 708, 710, 728, 746, 813, 818, 822, 823, 834, 835, 837, 854, 872, 945, 957, 973, 974, 976, 993, 1012, 1092, 1097, 1110, 1111, 1112, 1130, 1132, 1136, 1154, 1155, 1156, 1157, 1170, 1176, 1182, 1189, 1195, 1202, 1208, 1215, 1221, 1227, 1233]
Discarding 88 places :
Implicit Place search using SMT only with invariants took 1391 ms to find 88 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1182/1270 places, 2077/2077 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 1182 transition count 1962
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 133 rules applied. Total rules applied 248 place count 1067 transition count 1944
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 265 place count 1050 transition count 1944
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 265 place count 1050 transition count 1904
Deduced a syphon composed of 40 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 346 place count 1009 transition count 1904
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 357 place count 1005 transition count 1897
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 364 place count 998 transition count 1897
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 376 place count 986 transition count 1885
Iterating global reduction 5 with 12 rules applied. Total rules applied 388 place count 986 transition count 1885
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 390 place count 986 transition count 1883
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 390 place count 986 transition count 1882
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 392 place count 985 transition count 1882
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 393 place count 984 transition count 1880
Iterating global reduction 6 with 1 rules applied. Total rules applied 394 place count 984 transition count 1880
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 516 place count 923 transition count 1819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 517 place count 923 transition count 1818
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 520 place count 920 transition count 1813
Iterating global reduction 7 with 3 rules applied. Total rules applied 523 place count 920 transition count 1813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 524 place count 920 transition count 1812
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 526 place count 919 transition count 1812
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 527 place count 919 transition count 1811
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 529 place count 919 transition count 1809
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 531 place count 917 transition count 1809
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 9 with 31 rules applied. Total rules applied 562 place count 917 transition count 1778
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 593 place count 886 transition count 1778
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 594 place count 886 transition count 1777
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 614 place count 886 transition count 1777
Applied a total of 614 rules in 384 ms. Remains 886 /1182 variables (removed 296) and now considering 1777/2077 (removed 300) transitions.
// Phase 1: matrix 1777 rows 886 cols
[2023-03-12 09:54:29] [INFO ] Computed 125 place invariants in 25 ms
[2023-03-12 09:54:30] [INFO ] Implicit Places using invariants in 879 ms returned [109, 111, 207, 219, 221, 230, 231, 306, 313, 316, 319, 325, 326, 402, 412, 416, 424, 425, 497, 505, 508, 511, 515, 522, 523, 577, 594, 600, 603, 612, 613, 684, 694, 705, 712, 713, 797, 800, 802, 805, 882]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 883 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 845/1270 places, 1777/2077 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 845 transition count 1776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 844 transition count 1776
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 832 transition count 1764
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 832 transition count 1764
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 830 transition count 1762
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 830 transition count 1762
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 821 transition count 1753
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 821 transition count 1752
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 64 place count 821 transition count 1737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 79 place count 806 transition count 1737
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 806 transition count 1736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 805 transition count 1736
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 805 transition count 1736
Applied a total of 82 rules in 216 ms. Remains 805 /845 variables (removed 40) and now considering 1736/1777 (removed 41) transitions.
// Phase 1: matrix 1736 rows 805 cols
[2023-03-12 09:54:30] [INFO ] Computed 84 place invariants in 25 ms
[2023-03-12 09:54:31] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-12 09:54:31] [INFO ] Invariant cache hit.
[2023-03-12 09:54:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:54:33] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 805/1270 places, 1736/2077 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5518 ms. Remains : 805/1270 places, 1736/2077 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 131842 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131842 steps, saw 89989 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 09:54:36] [INFO ] Invariant cache hit.
[2023-03-12 09:54:37] [INFO ] [Real]Absence check using 19 positive place invariants in 61 ms returned sat
[2023-03-12 09:54:37] [INFO ] [Real]Absence check using 19 positive and 65 generalized place invariants in 58 ms returned sat
[2023-03-12 09:54:37] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 09:54:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-12 09:54:37] [INFO ] [Nat]Absence check using 19 positive and 65 generalized place invariants in 23 ms returned sat
[2023-03-12 09:54:47] [INFO ] After 10467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:54:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:54:48] [INFO ] After 428ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:54:48] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 2 ms to minimize.
[2023-03-12 09:54:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-12 09:54:49] [INFO ] After 1149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-12 09:54:49] [INFO ] After 12184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 65 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1736/1736 transitions.
Applied a total of 0 rules in 24 ms. Remains 805 /805 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 805/805 places, 1736/1736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1736/1736 transitions.
Applied a total of 0 rules in 27 ms. Remains 805 /805 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2023-03-12 09:54:49] [INFO ] Invariant cache hit.
[2023-03-12 09:54:50] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-12 09:54:50] [INFO ] Invariant cache hit.
[2023-03-12 09:54:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:54:52] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2023-03-12 09:54:52] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-12 09:54:52] [INFO ] Invariant cache hit.
[2023-03-12 09:54:53] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4275 ms. Remains : 805/805 places, 1736/1736 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 805 transition count 1732
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 801 transition count 1732
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 800 transition count 1732
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 798 transition count 1730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 798 transition count 1729
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 798 transition count 1728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 797 transition count 1728
Applied a total of 16 rules in 78 ms. Remains 797 /805 variables (removed 8) and now considering 1728/1736 (removed 8) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1728 rows 797 cols
[2023-03-12 09:54:53] [INFO ] Computed 83 place invariants in 14 ms
[2023-03-12 09:54:53] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 09:54:53] [INFO ] [Real]Absence check using 20 positive and 63 generalized place invariants in 25 ms returned sat
[2023-03-12 09:54:53] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 09:54:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 09:54:54] [INFO ] [Nat]Absence check using 20 positive and 63 generalized place invariants in 43 ms returned sat
[2023-03-12 09:55:04] [INFO ] After 10209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:55:04] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-12 09:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-12 09:55:05] [INFO ] After 10763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-12 09:55:05] [INFO ] After 11265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:55:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 51 ms.
[2023-03-12 09:55:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 805 places, 1736 transitions and 6887 arcs took 20 ms.
[2023-03-12 09:55:05] [INFO ] Flatten gal took : 209 ms
Total runtime 131457 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/578/inv_0_ --invariant=/tmp/578/inv_1_ --invariant=/tmp/578/inv_2_ --invariant=/tmp/578/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13002940 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098004 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-08b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597500134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;