fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419400823
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2731.663 3600000.00 13651894.00 920.50 TFT?TFT?TFFTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400823.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 MultiCrashLeafsetExtension-PT-S24C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 10M 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 MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679627383113

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 03:09:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 03:09:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 03:09:45] [INFO ] Load time of PNML (sax parser for PT used): 416 ms
[2023-03-24 03:09:45] [INFO ] Transformed 9748 places.
[2023-03-24 03:09:45] [INFO ] Transformed 14659 transitions.
[2023-03-24 03:09:45] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 565 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 241 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 03:09:46] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-24 03:09:47] [INFO ] Computed 921 place invariants in 798 ms
[2023-03-24 03:09:50] [INFO ] [Real]Absence check using 62 positive place invariants in 64 ms returned sat
[2023-03-24 03:09:51] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 483 ms returned sat
[2023-03-24 03:10:04] [INFO ] After 16828ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-24 03:10:06] [INFO ] [Nat]Absence check using 62 positive place invariants in 45 ms returned sat
[2023-03-24 03:10:07] [INFO ] [Nat]Absence check using 62 positive and 859 generalized place invariants in 472 ms returned sat
[2023-03-24 03:10:29] [INFO ] After 20803ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-24 03:10:29] [INFO ] State equation strengthened by 4402 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-24 03:10:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:10:29] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 102 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.33 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2253 transitions
Trivial Post-agglo rules discarded 2253 transitions
Performed 2253 trivial Post agglomeration. Transition count delta: 2253
Iterating post reduction 0 with 2253 rules applied. Total rules applied 2254 place count 9712 transition count 12406
Reduce places removed 2253 places and 0 transitions.
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4650 place count 7459 transition count 12263
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 4793 place count 7316 transition count 12263
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 4793 place count 7316 transition count 12075
Deduced a syphon composed of 188 places in 9 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 3 with 376 rules applied. Total rules applied 5169 place count 7128 transition count 12075
Discarding 2184 places :
Symmetric choice reduction at 3 with 2184 rule applications. Total rules 7353 place count 4944 transition count 9891
Iterating global reduction 3 with 2184 rules applied. Total rules applied 9537 place count 4944 transition count 9891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9537 place count 4944 transition count 9890
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9539 place count 4943 transition count 9890
Discarding 522 places :
Symmetric choice reduction at 3 with 522 rule applications. Total rules 10061 place count 4421 transition count 7802
Iterating global reduction 3 with 522 rules applied. Total rules applied 10583 place count 4421 transition count 7802
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 10627 place count 4399 transition count 7780
Free-agglomeration rule (complex) applied 245 times.
Iterating global reduction 3 with 245 rules applied. Total rules applied 10872 place count 4399 transition count 7535
Reduce places removed 245 places and 0 transitions.
Iterating post reduction 3 with 245 rules applied. Total rules applied 11117 place count 4154 transition count 7535
Partial Free-agglomeration rule applied 163 times.
Drop transitions removed 163 transitions
Iterating global reduction 4 with 163 rules applied. Total rules applied 11280 place count 4154 transition count 7535
Applied a total of 11280 rules in 4671 ms. Remains 4154 /9748 variables (removed 5594) and now considering 7535/14659 (removed 7124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4673 ms. Remains : 4154/9748 places, 7535/14659 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 10) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-24 03:10:35] [INFO ] Flow matrix only has 6690 transitions (discarded 845 similar events)
// Phase 1: matrix 6690 rows 4154 cols
[2023-03-24 03:10:35] [INFO ] Computed 885 place invariants in 172 ms
[2023-03-24 03:10:36] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-24 03:10:36] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 204 ms returned sat
[2023-03-24 03:10:40] [INFO ] After 4896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-24 03:10:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2023-03-24 03:10:41] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 211 ms returned sat
[2023-03-24 03:10:48] [INFO ] After 6369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-24 03:10:48] [INFO ] State equation strengthened by 2836 read => feed constraints.
[2023-03-24 03:11:03] [INFO ] After 15227ms SMT Verify possible using 2836 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-24 03:11:07] [INFO ] Deduced a trap composed of 231 places in 3805 ms of which 16 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-24 03:11:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:11:07] [INFO ] After 27410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 60 out of 4154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4154/4154 places, 7535/7535 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 0 with 4 rules applied. Total rules applied 4 place count 4154 transition count 7531
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4150 transition count 7531
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 4150 transition count 7525
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 4144 transition count 7525
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 32 place count 4132 transition count 7498
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 4132 transition count 7498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 44 place count 4132 transition count 7497
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 4131 transition count 7497
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 4124 transition count 7469
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 4124 transition count 7469
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 2 with 4 rules applied. Total rules applied 64 place count 4122 transition count 7467
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 4122 transition count 7449
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 100 place count 4104 transition count 7449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 4103 transition count 7448
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 4103 transition count 7448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 4102 transition count 7444
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 4102 transition count 7444
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 4102 transition count 7444
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 4100 transition count 7442
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 4100 transition count 7442
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 4098 transition count 7434
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 4098 transition count 7434
Applied a total of 118 rules in 4110 ms. Remains 4098 /4154 variables (removed 56) and now considering 7434/7535 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4110 ms. Remains : 4098/4154 places, 7434/7535 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 25075 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{2=1}
Probabilistic random walk after 25075 steps, saw 11629 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-24 03:11:15] [INFO ] Flow matrix only has 6572 transitions (discarded 862 similar events)
// Phase 1: matrix 6572 rows 4098 cols
[2023-03-24 03:11:15] [INFO ] Computed 885 place invariants in 149 ms
[2023-03-24 03:11:15] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-24 03:11:16] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 234 ms returned sat
[2023-03-24 03:11:19] [INFO ] After 2951ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 03:11:19] [INFO ] State equation strengthened by 2791 read => feed constraints.
[2023-03-24 03:11:19] [INFO ] After 570ms SMT Verify possible using 2791 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:11:19] [INFO ] After 4533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:11:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-24 03:11:20] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 222 ms returned sat
[2023-03-24 03:11:24] [INFO ] After 4049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:11:26] [INFO ] After 2082ms SMT Verify possible using 2791 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:11:30] [INFO ] Deduced a trap composed of 361 places in 3652 ms of which 4 ms to minimize.
[2023-03-24 03:11:34] [INFO ] Deduced a trap composed of 432 places in 3610 ms of which 4 ms to minimize.
[2023-03-24 03:11:39] [INFO ] Deduced a trap composed of 369 places in 3827 ms of which 5 ms to minimize.
[2023-03-24 03:11:43] [INFO ] Deduced a trap composed of 403 places in 3660 ms of which 4 ms to minimize.
[2023-03-24 03:11:47] [INFO ] Deduced a trap composed of 291 places in 3675 ms of which 4 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-24 03:11:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:11:47] [INFO ] After 27520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 56 out of 4098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4098/4098 places, 7434/7434 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4098 transition count 7433
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4097 transition count 7433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4096 transition count 7432
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4096 transition count 7432
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4096 transition count 7431
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4095 transition count 7431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4094 transition count 7427
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4094 transition count 7427
Applied a total of 8 rules in 1150 ms. Remains 4094 /4098 variables (removed 4) and now considering 7427/7434 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 4094/4098 places, 7427/7434 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25536 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25536 steps, saw 11833 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:11:51] [INFO ] Flow matrix only has 6565 transitions (discarded 862 similar events)
// Phase 1: matrix 6565 rows 4094 cols
[2023-03-24 03:11:51] [INFO ] Computed 885 place invariants in 155 ms
[2023-03-24 03:11:52] [INFO ] [Real]Absence check using 49 positive place invariants in 56 ms returned sat
[2023-03-24 03:11:52] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 241 ms returned sat
[2023-03-24 03:11:55] [INFO ] After 2990ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 03:11:55] [INFO ] State equation strengthened by 2788 read => feed constraints.
[2023-03-24 03:11:56] [INFO ] After 436ms SMT Verify possible using 2788 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:11:56] [INFO ] After 4401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:11:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2023-03-24 03:11:57] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 233 ms returned sat
[2023-03-24 03:12:02] [INFO ] After 5036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:12:07] [INFO ] After 5311ms SMT Verify possible using 2788 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:12:12] [INFO ] Deduced a trap composed of 391 places in 3639 ms of which 4 ms to minimize.
[2023-03-24 03:12:16] [INFO ] Deduced a trap composed of 335 places in 3634 ms of which 4 ms to minimize.
[2023-03-24 03:12:20] [INFO ] Deduced a trap composed of 382 places in 3599 ms of which 4 ms to minimize.
[2023-03-24 03:12:24] [INFO ] Deduced a trap composed of 297 places in 3647 ms of which 5 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-24 03:12:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:12:24] [INFO ] After 28522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 56 out of 4094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4094/4094 places, 7427/7427 transitions.
Applied a total of 0 rules in 476 ms. Remains 4094 /4094 variables (removed 0) and now considering 7427/7427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 4094/4094 places, 7427/7427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4094/4094 places, 7427/7427 transitions.
Applied a total of 0 rules in 459 ms. Remains 4094 /4094 variables (removed 0) and now considering 7427/7427 (removed 0) transitions.
[2023-03-24 03:12:25] [INFO ] Flow matrix only has 6565 transitions (discarded 862 similar events)
[2023-03-24 03:12:25] [INFO ] Invariant cache hit.
[2023-03-24 03:12:29] [INFO ] Implicit Places using invariants in 4116 ms returned [4, 7, 10, 11, 12, 14, 18, 24, 34, 44, 56, 70, 87, 105, 125, 147, 171, 194, 195, 196, 197, 198, 218, 236, 252, 266, 278, 288, 296, 302, 306, 308, 320, 326, 329, 330, 331, 332, 333, 335, 339, 345, 353, 363, 375, 389, 405, 423, 443, 465, 486, 487, 488, 489, 490, 508, 524, 538, 550, 560, 568, 574, 578, 580, 582, 593, 599, 602, 603, 604, 605, 606, 608, 610, 614, 620, 628, 638, 650, 664, 680, 698, 718, 737, 738, 739, 740, 741, 757, 771, 783, 793, 801, 807, 811, 813, 815, 817, 828, 834, 837, 838, 839, 840, 841, 843, 845, 847, 851, 857, 865, 875, 887, 901, 917, 935, 952, 953, 954, 955, 956, 970, 982, 992, 1000, 1006, 1010, 1012, 1014, 1016, 1018, 1035, 1038, 1039, 1040, 1041, 1042, 1044, 1046, 1048, 1050, 1054, 1060, 1068, 1078, 1090, 1104, 1120, 1135, 1136, 1137, 1138, 1139, 1151, 1161, 1169, 1175, 1179, 1181, 1183, 1185, 1187, 1189, 1200, 1206, 1209, 1210, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1227, 1233, 1241, 1253, 1265, 1279, 1292, 1293, 1294, 1295, 1296, 1306, 1314, 1320, 1324, 1327, 1329, 1331, 1333, 1335, 1337, 1349, 1355, 1358, 1359, 1360, 1361, 1362, 1364, 1366, 1368, 1370, 1372, 1374, 1378, 1384, 1392, 1402, 1414, 1425, 1426, 1427, 1428, 1429, 1437, 1443, 1447, 1449, 1451, 1453, 1455, 1457, 1459, 1461, 1472, 1478, 1481, 1482, 1483, 1484, 1485, 1487, 1489, 1491, 1493, 1495, 1497, 1499, 1503, 1509, 1517, 1527, 1536, 1537, 1538, 1539, 1540, 1546, 1550, 1552, 1554, 1556, 1560, 1562, 1564, 1566, 1577, 1583, 1586, 1587, 1588, 1589, 1590, 1593, 1595, 1597, 1599, 1601, 1603, 1605, 1607, 1611, 1617, 1625, 1632, 1633, 1634, 1635, 1636, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1669, 1675, 1678, 1679, 1680, 1681, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1704, 1710, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1750, 1756, 1759, 1760, 1761, 1762, 1763, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1787, 1790, 1791, 1792, 1793, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1825, 1831, 1834, 1835, 1836, 1837, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1860, 1863, 1864, 1865, 1866, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1898, 1900, 1904, 1907, 1908, 1909, 1910, 1911, 1913, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1936, 1937, 1938, 1939, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1971, 1977, 1980, 1981, 1982, 1983, 1984, 1986, 1988, 1990, 1992, 1994, 1996, 1998, 2000, 2002, 2004, 2006, 2009, 2010, 2011, 2012, 2013, 2015, 2017, 2019, 2021, 2023, 2025, 2027, 2029, 2031, 2033, 2044, 2050, 2053, 2054, 2055, 2056, 2057, 2059, 2061, 2063, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2079, 2084, 2085, 2086, 2087, 2088, 2090, 2092, 2094, 2096, 2098, 2100, 2102, 2104, 2106, 2108, 2119, 2125, 2128, 2129, 2130, 2131, 2132, 2134, 2136, 2138, 2140, 2142, 2144, 2146, 2148, 2150, 2152, 2157, 2164, 2165, 2166, 2167, 2168, 2172, 2174, 2176, 2178, 2180, 2182, 2184, 2186, 2188, 2190, 2201, 2207, 2210, 2211, 2212, 2213, 2214, 2216, 2220, 2222, 2224, 2226, 2228, 2230, 2232, 2236, 2242, 2251, 2252, 2253, 2254, 2255, 2262, 2266, 2268, 2270, 2272, 2274, 2276, 2278, 2280, 2282, 2299, 2302, 2303, 2304, 2305, 2306, 2308, 2310, 2312, 2314, 2316, 2318, 2320, 2322, 2326, 2332, 2340, 2351, 2352, 2353, 2354, 2355, 2363, 2369, 2373, 2375, 2377, 2379, 2381, 2383, 2385, 2387, 2398, 2404, 2407, 2408, 2409, 2410, 2411, 2413, 2415, 2417, 2419, 2421, 2423, 2425, 2429, 2435, 2443, 2453, 2466, 2468, 2469, 2470, 2480, 2490, 2496, 2500, 2502, 2504, 2506, 2508, 2510, 2512, 2524, 2530, 2534, 2535, 2536, 2537, 2539, 2541, 2543, 2545, 2547, 2549, 2553, 2559, 2567, 2578, 2592, 2607, 2608, 2609, 2610, 2611, 2623, 2633, 2648, 2652, 2654, 2656, 2658, 2660, 2662, 2674, 2680, 2683, 2684, 2685, 2686, 2687, 2689, 2691, 2693, 2695, 2697, 2701, 2707, 2715, 2725, 2737, 2751, 2768, 2769, 2770, 2771, 2772, 2786, 2798, 2808, 2816, 2822, 2826, 2828, 2830, 2832, 2834, 2851, 2854, 2855, 2857, 2858, 2860, 2864, 2866, 2868, 2872, 2878, 2886, 2896, 2908, 2922, 2938, 2957, 2958, 2959, 2960, 2961, 2977, 2991, 3003, 3013, 3021, 3027, 3031, 3033, 3035, 3037, 3049, 3055, 3058, 3059, 3060, 3061, 3062, 3064, 3066, 3069, 3073, 3079, 3087, 3097, 3109, 3123, 3139, 3157, 3178, 3179, 3180, 3181, 3182, 3200, 3216, 3230, 3242, 3252, 3260, 3266, 3270, 3272, 3274, 3285, 3291, 3294, 3295, 3296, 3297, 3298, 3300, 3302, 3306, 3312, 3320, 3330, 3342, 3356, 3372, 3390, 3411, 3434, 3435, 3436, 3437, 3438, 3458, 3476, 3492, 3506, 3518, 3528, 3536, 3542, 3546, 3548, 3559, 3561, 3564, 3567, 3568, 3569, 3570, 3571, 3573, 3577, 3583, 3591, 3601, 3613, 3627, 3643, 3661, 3681, 3703, 3728, 3729, 3730, 3731, 3732, 3754, 3774, 3792, 3808, 3822, 3834, 3844, 3852, 3858, 3862, 3873]
Discarding 817 places :
Implicit Place search using SMT only with invariants took 4130 ms to find 817 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3277/4094 places, 7427/7427 transitions.
Discarding 187 places :
Symmetric choice reduction at 0 with 187 rule applications. Total rules 187 place count 3090 transition count 7240
Iterating global reduction 0 with 187 rules applied. Total rules applied 374 place count 3090 transition count 7240
Discarding 185 places :
Symmetric choice reduction at 0 with 185 rule applications. Total rules 559 place count 2905 transition count 7055
Iterating global reduction 0 with 185 rules applied. Total rules applied 744 place count 2905 transition count 7055
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 785 place count 2864 transition count 6891
Iterating global reduction 0 with 41 rules applied. Total rules applied 826 place count 2864 transition count 6891
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 829 place count 2864 transition count 6888
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 832 place count 2861 transition count 6888
Applied a total of 832 rules in 1700 ms. Remains 2861 /3277 variables (removed 416) and now considering 6888/7427 (removed 539) transitions.
[2023-03-24 03:12:31] [INFO ] Flow matrix only has 6026 transitions (discarded 862 similar events)
// Phase 1: matrix 6026 rows 2861 cols
[2023-03-24 03:12:31] [INFO ] Computed 68 place invariants in 162 ms
[2023-03-24 03:12:35] [INFO ] Implicit Places using invariants in 3543 ms returned [1245, 1970]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3548 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2859/4094 places, 6888/7427 transitions.
Applied a total of 0 rules in 399 ms. Remains 2859 /2859 variables (removed 0) and now considering 6888/6888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 10242 ms. Remains : 2859/4094 places, 6888/7427 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 29326 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29326 steps, saw 12555 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:12:38] [INFO ] Flow matrix only has 6026 transitions (discarded 862 similar events)
// Phase 1: matrix 6026 rows 2859 cols
[2023-03-24 03:12:39] [INFO ] Computed 66 place invariants in 161 ms
[2023-03-24 03:12:39] [INFO ] [Real]Absence check using 47 positive place invariants in 57 ms returned sat
[2023-03-24 03:12:39] [INFO ] [Real]Absence check using 47 positive and 19 generalized place invariants in 29 ms returned sat
[2023-03-24 03:12:42] [INFO ] After 3708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:12:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 59 ms returned sat
[2023-03-24 03:12:43] [INFO ] [Nat]Absence check using 47 positive and 19 generalized place invariants in 28 ms returned sat
[2023-03-24 03:12:48] [INFO ] After 5240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:12:48] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-24 03:12:50] [INFO ] After 2110ms SMT Verify possible using 2665 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:12:52] [INFO ] Deduced a trap composed of 194 places in 1791 ms of which 3 ms to minimize.
[2023-03-24 03:12:55] [INFO ] Deduced a trap composed of 217 places in 1849 ms of which 3 ms to minimize.
[2023-03-24 03:12:57] [INFO ] Deduced a trap composed of 171 places in 1928 ms of which 3 ms to minimize.
[2023-03-24 03:12:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6992 ms
[2023-03-24 03:12:59] [INFO ] After 11093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1412 ms.
[2023-03-24 03:13:01] [INFO ] After 18291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 56 out of 2859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 6888/6888 transitions.
Applied a total of 0 rules in 431 ms. Remains 2859 /2859 variables (removed 0) and now considering 6888/6888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 2859/2859 places, 6888/6888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 6888/6888 transitions.
Applied a total of 0 rules in 401 ms. Remains 2859 /2859 variables (removed 0) and now considering 6888/6888 (removed 0) transitions.
[2023-03-24 03:13:01] [INFO ] Flow matrix only has 6026 transitions (discarded 862 similar events)
[2023-03-24 03:13:01] [INFO ] Invariant cache hit.
[2023-03-24 03:13:05] [INFO ] Implicit Places using invariants in 3217 ms returned []
[2023-03-24 03:13:05] [INFO ] Flow matrix only has 6026 transitions (discarded 862 similar events)
[2023-03-24 03:13:05] [INFO ] Invariant cache hit.
[2023-03-24 03:13:05] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-24 03:13:24] [INFO ] Implicit Places using invariants and state equation in 19462 ms returned []
Implicit Place search using SMT with State Equation took 22684 ms to find 0 implicit places.
[2023-03-24 03:13:25] [INFO ] Redundant transitions in 702 ms returned []
[2023-03-24 03:13:25] [INFO ] Flow matrix only has 6026 transitions (discarded 862 similar events)
[2023-03-24 03:13:25] [INFO ] Invariant cache hit.
[2023-03-24 03:13:29] [INFO ] Dead Transitions using invariants and state equation in 4114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27914 ms. Remains : 2859/2859 places, 6888/6888 transitions.
Graph (trivial) has 2441 edges and 2859 vertex of which 24 / 2859 are part of one of the 1 SCC in 6 ms
Free SCC test removed 23 places
Drop transitions removed 593 transitions
Ensure Unique test removed 867 transitions
Reduce isomorphic transitions removed 1460 transitions.
Graph (complete) has 8741 edges and 2836 vertex of which 2819 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 24 places
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 2795 transition count 5191
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 1 with 709 rules applied. Total rules applied 972 place count 2558 transition count 4719
Reduce places removed 235 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 235 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 2 with 665 rules applied. Total rules applied 1637 place count 2323 transition count 4289
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 3 with 582 rules applied. Total rules applied 2219 place count 2128 transition count 3902
Reduce places removed 192 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 4 with 539 rules applied. Total rules applied 2758 place count 1936 transition count 3555
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 5 with 463 rules applied. Total rules applied 3221 place count 1781 transition count 3247
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 153 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 6 with 427 rules applied. Total rules applied 3648 place count 1628 transition count 2973
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 7 with 361 rules applied. Total rules applied 4009 place count 1507 transition count 2733
Reduce places removed 119 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 8 with 330 rules applied. Total rules applied 4339 place count 1388 transition count 2522
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 9 with 274 rules applied. Total rules applied 4613 place count 1296 transition count 2340
Reduce places removed 90 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 10 with 247 rules applied. Total rules applied 4860 place count 1206 transition count 2183
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 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 11 with 198 rules applied. Total rules applied 5058 place count 1139 transition count 2052
Reduce places removed 64 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 12 with 174 rules applied. Total rules applied 5232 place count 1075 transition count 1942
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 13 with 136 rules applied. Total rules applied 5368 place count 1029 transition count 1852
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 119 rules applied. Total rules applied 5487 place count 985 transition count 1777
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 91 rules applied. Total rules applied 5578 place count 954 transition count 1717
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 16 with 75 rules applied. Total rules applied 5653 place count 925 transition count 1671
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 50 rules applied. Total rules applied 5703 place count 908 transition count 1638
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 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 18 with 40 rules applied. Total rules applied 5743 place count 892 transition count 1614
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 22 rules applied. Total rules applied 5765 place count 884 transition count 1600
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 14 rules applied. Total rules applied 5779 place count 878 transition count 1592
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 21 with 32 rules applied. Total rules applied 5811 place count 876 transition count 1562
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 22 with 35 rules applied. Total rules applied 5846 place count 848 transition count 1555
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 11 Pre rules applied. Total rules applied 5846 place count 848 transition count 1544
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 23 with 22 rules applied. Total rules applied 5868 place count 837 transition count 1544
Discarding 573 places :
Symmetric choice reduction at 23 with 573 rule applications. Total rules 6441 place count 264 transition count 958
Iterating global reduction 23 with 573 rules applied. Total rules applied 7014 place count 264 transition count 958
Ensure Unique test removed 469 transitions
Reduce isomorphic transitions removed 469 transitions.
Iterating post reduction 23 with 469 rules applied. Total rules applied 7483 place count 264 transition count 489
Discarding 8 places :
Symmetric choice reduction at 24 with 8 rule applications. Total rules 7491 place count 256 transition count 454
Iterating global reduction 24 with 8 rules applied. Total rules applied 7499 place count 256 transition count 454
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 24 with 98 rules applied. Total rules applied 7597 place count 207 transition count 405
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 24 with 37 rules applied. Total rules applied 7634 place count 207 transition count 368
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 25 with 14 rules applied. Total rules applied 7648 place count 200 transition count 415
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 7649 place count 199 transition count 411
Iterating global reduction 25 with 1 rules applied. Total rules applied 7650 place count 199 transition count 411
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 25 with 38 rules applied. Total rules applied 7688 place count 199 transition count 373
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 25 with 19 rules applied. Total rules applied 7707 place count 199 transition count 354
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 26 with 21 rules applied. Total rules applied 7728 place count 180 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 7730 place count 178 transition count 352
Discarding 7 places :
Symmetric choice reduction at 28 with 7 rule applications. Total rules 7737 place count 171 transition count 336
Iterating global reduction 28 with 7 rules applied. Total rules applied 7744 place count 171 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 3 rules applied. Total rules applied 7747 place count 171 transition count 333
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 7748 place count 171 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 7749 place count 170 transition count 332
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 30 with 9 rules applied. Total rules applied 7758 place count 170 transition count 323
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 30 with 9 rules applied. Total rules applied 7767 place count 161 transition count 323
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 31 with 29 rules applied. Total rules applied 7796 place count 161 transition count 323
Partial Post-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 31 with 12 rules applied. Total rules applied 7808 place count 161 transition count 323
Applied a total of 7808 rules in 2247 ms. Remains 161 /2859 variables (removed 2698) and now considering 323/6888 (removed 6565) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 323 rows 161 cols
[2023-03-24 03:13:31] [INFO ] Computed 25 place invariants in 7 ms
[2023-03-24 03:13:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-24 03:13:31] [INFO ] [Real]Absence check using 8 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-24 03:13:31] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 03:13:31] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 03:13:31] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-24 03:13:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-24 03:13:31] [INFO ] [Nat]Absence check using 8 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-24 03:13:32] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:13:32] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-24 03:13:32] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:13:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-24 03:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2859 places, 6888 transitions and 32117 arcs took 38 ms.
[2023-03-24 03:13:32] [INFO ] Flatten gal took : 451 ms
Total runtime 228409 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 --inv-bin-par --invariant=/tmp/572/inv_0_ --invariant=/tmp/572/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13396768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16079712 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 ReachabilityFireability -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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="ReachabilityFireability"
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 MultiCrashLeafsetExtension-PT-S24C04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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