MCC'2024- Execution of r246-tall-171654350700037

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.760	1825284.00	2172440.00	6177.10	1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350700037.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716571306273

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 17:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 17:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:21:47] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2024-05-24 17:21:47] [INFO ] Transformed 5568 places.
[2024-05-24 17:21:47] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:21:47] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 17:21:48] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-24 17:21:48] [INFO ] Computed 573 invariants in 441 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 17, 17, 1, +inf, 17, 1, 20, 51, 17, 1, 1, 17, 51, 17, 17]
RANDOM walk for 10000 steps (160 resets) in 126 ms. (78 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150011 steps (645 resets) in 520 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1] Max Struct:[51, 17, 17, 1, +inf, 17, 20, 51, 17, 1, 1, 17, 51, 17, 17]
[2024-05-24 17:21:49] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
[2024-05-24 17:21:49] [INFO ] Invariant cache hit.
[2024-05-24 17:21:50] [INFO ] [Real]Absence check using 50 positive place invariants in 94 ms returned sat
[2024-05-24 17:21:50] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 217 ms returned unsat
[2024-05-24 17:21:51] [INFO ] [Real]Absence check using 50 positive place invariants in 86 ms returned sat
[2024-05-24 17:21:51] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 159 ms returned unsat
[2024-05-24 17:21:51] [INFO ] [Real]Absence check using 50 positive place invariants in 92 ms returned sat
[2024-05-24 17:21:52] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 163 ms returned unsat
[2024-05-24 17:21:52] [INFO ] [Real]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-24 17:21:52] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 202 ms returned sat
[2024-05-24 17:21:57] [INFO ] [Real]Absence check using state equation in 4213 ms returned unknown
[2024-05-24 17:21:57] [INFO ] [Real]Absence check using 50 positive place invariants in 76 ms returned sat
[2024-05-24 17:21:57] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 149 ms returned unsat
[2024-05-24 17:21:58] [INFO ] [Real]Absence check using 50 positive place invariants in 76 ms returned sat
[2024-05-24 17:21:58] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 149 ms returned unsat
[2024-05-24 17:21:59] [INFO ] [Real]Absence check using 50 positive place invariants in 76 ms returned sat
[2024-05-24 17:21:59] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 164 ms returned unsat
[2024-05-24 17:21:59] [INFO ] [Real]Absence check using 50 positive place invariants in 73 ms returned sat
[2024-05-24 17:22:00] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 153 ms returned unsat
[2024-05-24 17:22:00] [INFO ] [Real]Absence check using 50 positive place invariants in 74 ms returned sat
[2024-05-24 17:22:00] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 164 ms returned unsat
[2024-05-24 17:22:01] [INFO ] [Real]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-24 17:22:01] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 196 ms returned sat
[2024-05-24 17:22:05] [INFO ] [Real]Absence check using state equation in 4264 ms returned unknown
[2024-05-24 17:22:06] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2024-05-24 17:22:06] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 197 ms returned sat
[2024-05-24 17:22:10] [INFO ] [Real]Absence check using state equation in 4229 ms returned unknown
[2024-05-24 17:22:11] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2024-05-24 17:22:11] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 171 ms returned sat
[2024-05-24 17:22:15] [INFO ] [Real]Absence check using state equation in 4317 ms returned unknown
[2024-05-24 17:22:16] [INFO ] [Real]Absence check using 50 positive place invariants in 72 ms returned sat
[2024-05-24 17:22:16] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 172 ms returned sat
[2024-05-24 17:22:20] [INFO ] [Real]Absence check using state equation in 4016 ms returned sat
[2024-05-24 17:22:20] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:22:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 17:22:21] [INFO ] [Real]Absence check using 50 positive place invariants in 89 ms returned sat
[2024-05-24 17:22:21] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 196 ms returned sat
[2024-05-24 17:22:25] [INFO ] [Real]Absence check using state equation in 4231 ms returned unknown
[2024-05-24 17:22:26] [INFO ] [Real]Absence check using 50 positive place invariants in 73 ms returned sat
[2024-05-24 17:22:26] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 153 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 51, 17, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 17, 51, 17]
Support contains 6 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.20 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1629 transitions
Trivial Post-agglo rules discarded 1629 transitions
Performed 1629 trivial Post agglomeration. Transition count delta: 1629
Iterating post reduction 0 with 1629 rules applied. Total rules applied 1630 place count 5536 transition count 6170
Reduce places removed 1629 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1630 rules applied. Total rules applied 3260 place count 3907 transition count 6169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3261 place count 3906 transition count 6169
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3261 place count 3906 transition count 5965
Deduced a syphon composed of 204 places in 8 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3669 place count 3702 transition count 5965
Discarding 1425 places :
Symmetric choice reduction at 3 with 1425 rule applications. Total rules 5094 place count 2277 transition count 4540
Iterating global reduction 3 with 1425 rules applied. Total rules applied 6519 place count 2277 transition count 4540
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 6519 place count 2277 transition count 4530
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 6539 place count 2267 transition count 4530
Discarding 235 places :
Symmetric choice reduction at 3 with 235 rule applications. Total rules 6774 place count 2032 transition count 3120
Iterating global reduction 3 with 235 rules applied. Total rules applied 7009 place count 2032 transition count 3120
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7043 place count 2015 transition count 3103
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 7206 place count 2015 transition count 4115
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 7369 place count 1852 transition count 4115
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 7403 place count 1852 transition count 4115
Applied a total of 7403 rules in 1822 ms. Remains 1852 /5568 variables (removed 3716) and now considering 4115/7799 (removed 3684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 1852/5568 places, 4115/7799 transitions.
[2024-05-24 17:22:28] [INFO ] Flow matrix only has 3717 transitions (discarded 398 similar events)
// Phase 1: matrix 3717 rows 1852 cols
[2024-05-24 17:22:28] [INFO ] Computed 541 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 2, 1]
RANDOM walk for 1000000 steps (26668 resets) in 15632 ms. (63 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (14597 resets) in 10624 ms. (282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 2]
[2024-05-24 17:22:54] [INFO ] Flow matrix only has 3717 transitions (discarded 398 similar events)
[2024-05-24 17:22:54] [INFO ] Invariant cache hit.
[2024-05-24 17:22:55] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-24 17:22:55] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 82 ms returned sat
[2024-05-24 17:22:56] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2024-05-24 17:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:22:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2024-05-24 17:22:56] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 82 ms returned sat
[2024-05-24 17:22:57] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2024-05-24 17:22:57] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:22:59] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1684 ms returned sat
[2024-05-24 17:23:00] [INFO ] Deduced a trap composed of 216 places in 1485 ms of which 93 ms to minimize.
[2024-05-24 17:23:02] [INFO ] Deduced a trap composed of 353 places in 1398 ms of which 13 ms to minimize.
[2024-05-24 17:23:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3252 ms
[2024-05-24 17:23:02] [INFO ] Computed and/alt/rep : 1613/3892/1613 causal constraints (skipped 2087 transitions) in 365 ms.
[2024-05-24 17:23:03] [INFO ] Added : 13 causal constraints over 3 iterations in 1208 ms. Result :sat
Minimization took 5263 ms.
[2024-05-24 17:23:09] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2024-05-24 17:23:09] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 86 ms returned sat
[2024-05-24 17:23:10] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2024-05-24 17:23:10] [INFO ] [Real]Added 2178 Read/Feed constraints in 275 ms returned sat
[2024-05-24 17:23:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:23:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 17:23:10] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 84 ms returned sat
[2024-05-24 17:23:11] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2024-05-24 17:23:13] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1086 ms returned sat
[2024-05-24 17:23:14] [INFO ] Deduced a trap composed of 313 places in 1342 ms of which 12 ms to minimize.
[2024-05-24 17:23:15] [INFO ] Deduced a trap composed of 158 places in 1438 ms of which 12 ms to minimize.
[2024-05-24 17:23:17] [INFO ] Deduced a trap composed of 174 places in 1417 ms of which 12 ms to minimize.
[2024-05-24 17:23:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4630 ms
[2024-05-24 17:23:18] [INFO ] Computed and/alt/rep : 1613/3892/1613 causal constraints (skipped 2087 transitions) in 568 ms.
[2024-05-24 17:23:20] [INFO ] Deduced a trap composed of 155 places in 1412 ms of which 12 ms to minimize.
[2024-05-24 17:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1662 ms
[2024-05-24 17:23:20] [INFO ] Added : 15 causal constraints over 3 iterations in 3224 ms. Result :sat
Minimization took 5179 ms.
[2024-05-24 17:23:26] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2024-05-24 17:23:26] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1852/1852 places, 4115/4115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1852 transition count 4113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1850 transition count 4113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1850 transition count 4111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 1848 transition count 4111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 1845 transition count 4108
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 1845 transition count 4108
Applied a total of 14 rules in 359 ms. Remains 1845 /1852 variables (removed 7) and now considering 4108/4115 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 1845/1852 places, 4108/4115 transitions.
[2024-05-24 17:23:26] [INFO ] Flow matrix only has 3710 transitions (discarded 398 similar events)
// Phase 1: matrix 3710 rows 1845 cols
[2024-05-24 17:23:26] [INFO ] Computed 541 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (26660 resets) in 15467 ms. (64 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (4866 resets) in 3538 ms. (282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:23:45] [INFO ] Flow matrix only has 3710 transitions (discarded 398 similar events)
[2024-05-24 17:23:45] [INFO ] Invariant cache hit.
[2024-05-24 17:23:45] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 17:23:46] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 81 ms returned sat
[2024-05-24 17:23:47] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2024-05-24 17:23:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:23:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 17:23:47] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 80 ms returned sat
[2024-05-24 17:23:48] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2024-05-24 17:23:48] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:23:50] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1811 ms returned sat
[2024-05-24 17:23:51] [INFO ] Deduced a trap composed of 253 places in 1452 ms of which 11 ms to minimize.
[2024-05-24 17:23:53] [INFO ] Deduced a trap composed of 330 places in 1317 ms of which 11 ms to minimize.
[2024-05-24 17:23:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3104 ms
[2024-05-24 17:23:53] [INFO ] Computed and/alt/rep : 1608/3884/1608 causal constraints (skipped 2085 transitions) in 228 ms.
[2024-05-24 17:23:54] [INFO ] Added : 16 causal constraints over 4 iterations in 1148 ms. Result :sat
Minimization took 4565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1845 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 4106/4106 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 4104
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1843 transition count 4102
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 1842 transition count 4100
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 1841 transition count 4098
Applied a total of 4 rules in 163 ms. Remains 1841 /1845 variables (removed 4) and now considering 4098/4106 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1841/1845 places, 4098/4106 transitions.
[2024-05-24 17:23:59] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
// Phase 1: matrix 3700 rows 1841 cols
[2024-05-24 17:23:59] [INFO ] Computed 541 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (26671 resets) in 15418 ms. (64 steps per ms)
BEST_FIRST walk for 1000000 steps (4866 resets) in 3506 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:24:18] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
[2024-05-24 17:24:18] [INFO ] Invariant cache hit.
[2024-05-24 17:24:18] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2024-05-24 17:24:18] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 77 ms returned sat
[2024-05-24 17:24:19] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2024-05-24 17:24:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:24:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2024-05-24 17:24:19] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 81 ms returned sat
[2024-05-24 17:24:20] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2024-05-24 17:24:20] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:24:22] [INFO ] [Nat]Added 2173 Read/Feed constraints in 1790 ms returned sat
[2024-05-24 17:24:24] [INFO ] Deduced a trap composed of 312 places in 1308 ms of which 12 ms to minimize.
[2024-05-24 17:24:25] [INFO ] Deduced a trap composed of 160 places in 1420 ms of which 12 ms to minimize.
[2024-05-24 17:24:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3048 ms
[2024-05-24 17:24:25] [INFO ] Computed and/alt/rep : 1598/3869/1598 causal constraints (skipped 2085 transitions) in 219 ms.
[2024-05-24 17:24:26] [INFO ] Added : 16 causal constraints over 4 iterations in 1181 ms. Result :sat
Minimization took 5348 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 4098/4098 transitions.
Applied a total of 0 rules in 140 ms. Remains 1841 /1841 variables (removed 0) and now considering 4098/4098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1841/1841 places, 4098/4098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 4098/4098 transitions.
Applied a total of 0 rules in 120 ms. Remains 1841 /1841 variables (removed 0) and now considering 4098/4098 (removed 0) transitions.
[2024-05-24 17:24:32] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
[2024-05-24 17:24:32] [INFO ] Invariant cache hit.
[2024-05-24 17:24:36] [INFO ] Implicit Places using invariants in 3664 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 337, 348, 358, 359, 360, 361, 362, 363, 364, 372, 378, 382, 384, 386, 388, 403, 409, 411, 412, 413, 414, 415, 416, 417, 419, 421, 423, 427, 433, 441, 450, 458, 459, 460, 461, 462, 463, 464, 470, 474, 476, 478, 480, 482, 497, 503, 505, 506, 507, 508, 509, 510, 511, 513, 515, 517, 519, 523, 529, 536, 542, 543, 544, 545, 546, 547, 548, 552, 554, 556, 558, 560, 562, 577, 583, 585, 586, 587, 588, 589, 590, 591, 593, 595, 597, 599, 601, 605, 610, 614, 615, 616, 617, 618, 619, 620, 622, 624, 626, 628, 630, 632, 647, 653, 655, 656, 657, 658, 659, 660, 661, 663, 665, 667, 669, 671, 673, 676, 678, 679, 680, 681, 682, 683, 684, 686, 688, 690, 692, 694, 696, 711, 717, 719, 720, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 746, 747, 749, 751, 753, 755, 757, 759, 774, 776, 779, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 811, 813, 815, 817, 819, 821, 836, 842, 844, 845, 846, 847, 848, 849, 850, 852, 854, 856, 858, 860, 862, 864, 866, 867, 868, 869, 870, 871, 872, 874, 876, 878, 880, 882, 884, 899, 905, 907, 908, 909, 910, 911, 912, 913, 915, 917, 919, 921, 923, 925, 927, 930, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 963, 969, 971, 972, 973, 974, 975, 976, 977, 979, 981, 983, 985, 987, 989, 993, 998, 999, 1000, 1001, 1002, 1003, 1004, 1008, 1010, 1012, 1014, 1016, 1018, 1033, 1039, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1049, 1051, 1053, 1055, 1057, 1061, 1067, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1086, 1090, 1092, 1094, 1096, 1098, 1113, 1119, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1129, 1131, 1133, 1135, 1139, 1145, 1153, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1176, 1182, 1186, 1188, 1190, 1192, 1207, 1213, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1223, 1225, 1227, 1231, 1237, 1245, 1255, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1282, 1290, 1296, 1300, 1302, 1304, 1319, 1325, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1335, 1337, 1341, 1347, 1355, 1365, 1377, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1408, 1418, 1426, 1432, 1436, 1438, 1453, 1455, 1458, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1468, 1472, 1478, 1486, 1496, 1508, 1522, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1557, 1569, 1579, 1587, 1593, 1597, 1612]
[2024-05-24 17:24:36] [INFO ] Actually due to overlaps returned [161, 295, 403, 497, 577, 647, 711, 774, 836, 899, 963, 1033, 1113, 1207, 1319, 1453, 1612, 4, 9, 10, 11, 12, 13, 14, 98, 99, 100, 101, 102, 103, 169, 170, 171, 172, 173, 174, 242, 243, 244, 245, 246, 247, 303, 304, 305, 306, 307, 308, 358, 359, 360, 361, 362, 363, 411, 412, 413, 414, 415, 416, 458, 459, 460, 461, 462, 463, 505, 506, 507, 508, 509, 510, 542, 543, 544, 545, 546, 547, 585, 586, 587, 588, 589, 590, 614, 615, 616, 617, 618, 619, 655, 656, 657, 658, 659, 660, 678, 679, 680, 681, 682, 683, 719, 720, 721, 722, 723, 724, 741, 742, 743, 744, 745, 746, 776, 781, 782, 783, 784, 785, 786, 803, 804, 805, 806, 807, 808, 844, 845, 846, 847, 848, 849, 866, 867, 868, 869, 870, 871, 907, 908, 909, 910, 911, 912, 930, 931, 932, 933, 934, 935, 971, 972, 973, 974, 975, 976, 998, 999, 1000, 1001, 1002, 1003, 1041, 1042, 1043, 1044, 1045, 1046, 1074, 1075, 1076, 1077, 1078, 1079, 1121, 1122, 1123, 1124, 1125, 1126, 1162, 1163, 1164, 1165, 1166, 1167, 1215, 1216, 1217, 1218, 1219, 1220, 1266, 1267, 1268, 1269, 1270, 1271, 1327, 1328, 1329, 1330, 1331, 1332, 1390, 1391, 1392, 1393, 1394, 1395, 1455, 1460, 1461, 1462, 1463, 1464, 1465, 1537, 1538, 1539, 1540, 1541, 1542]
Discarding 224 places :
Implicit Place search using SMT only with invariants took 3683 ms to find 224 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1617/1841 places, 4098/4098 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 1425 transition count 3906
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 1425 transition count 3906
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 576 place count 1233 transition count 3714
Iterating global reduction 0 with 192 rules applied. Total rules applied 768 place count 1233 transition count 3714
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 771 place count 1233 transition count 3711
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 774 place count 1230 transition count 3711
Applied a total of 774 rules in 281 ms. Remains 1230 /1617 variables (removed 387) and now considering 3711/4098 (removed 387) transitions.
[2024-05-24 17:24:36] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
// Phase 1: matrix 3313 rows 1230 cols
[2024-05-24 17:24:36] [INFO ] Computed 317 invariants in 28 ms
[2024-05-24 17:24:38] [INFO ] Implicit Places using invariants in 2280 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 152, 154, 156, 160, 166, 174, 184, 196, 209, 221, 231, 239, 245, 249, 251, 253, 261, 263, 265, 267, 271, 277, 285, 291, 302, 312, 320, 326, 330, 332, 334, 336, 344, 346, 348, 350, 352, 356, 362, 370, 379, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1047, 1053, 1057, 1059, 1065, 1067, 1069, 1073, 1079, 1087, 1097, 1109, 1123, 1138, 1152, 1164, 1174, 1182, 1188, 1192]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2291 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 958/1841 places, 3711/4098 transitions.
Applied a total of 0 rules in 98 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6477 ms. Remains : 958/1841 places, 3711/4098 transitions.
[2024-05-24 17:24:38] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
// Phase 1: matrix 3313 rows 958 cols
[2024-05-24 17:24:38] [INFO ] Computed 45 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28283 resets) in 14872 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (3582 resets) in 2558 ms. (390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:24:56] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:24:56] [INFO ] Invariant cache hit.
[2024-05-24 17:24:56] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 17:24:56] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:24:57] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-05-24 17:24:57] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:24:57] [INFO ] [Real]Added 2173 Read/Feed constraints in 420 ms returned sat
[2024-05-24 17:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:24:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 17:24:57] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:24:58] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2024-05-24 17:24:59] [INFO ] [Nat]Added 2173 Read/Feed constraints in 888 ms returned sat
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 93 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 235 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 126 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 57 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2358 ms
[2024-05-24 17:25:02] [INFO ] Computed and/alt/rep : 1324/1905/1324 causal constraints (skipped 1927 transitions) in 175 ms.
[2024-05-24 17:25:02] [INFO ] Added : 13 causal constraints over 3 iterations in 708 ms. Result :sat
Minimization took 4863 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 104 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 93 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:25:07] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:25:07] [INFO ] Invariant cache hit.
[2024-05-24 17:25:08] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2024-05-24 17:25:08] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:25:08] [INFO ] Invariant cache hit.
[2024-05-24 17:25:09] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:25:37] [INFO ] Implicit Places using invariants and state equation in 29190 ms returned []
Implicit Place search using SMT with State Equation took 30296 ms to find 0 implicit places.
[2024-05-24 17:25:38] [INFO ] Redundant transitions in 190 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:25:38] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:25:38] [INFO ] Invariant cache hit.
[2024-05-24 17:25:38] [INFO ] State equation strengthened by 2173 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 50688ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 50734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81356 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1485 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
[2024-05-24 17:26:29] [INFO ] Flatten gal took : 348 ms
[2024-05-24 17:26:29] [INFO ] Flatten gal took : 173 ms
[2024-05-24 17:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16019134570940419905.gal : 70 ms
[2024-05-24 17:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7324457039503902758.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16019134570940419905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7324457039503902758.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7324457039503902758.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
Interrupted probabilistic random walk after 69699 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 69699 steps, saw 29117 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:26:32] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:26:32] [INFO ] Invariant cache hit.
[2024-05-24 17:26:32] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
[2024-05-24 17:26:33] [INFO ] Deduced a trap composed of 89 places in 505 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
[2024-05-24 17:26:33] [INFO ] Deduced a trap composed of 103 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:26:34] [INFO ] Deduced a trap composed of 87 places in 479 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
[2024-05-24 17:26:34] [INFO ] Deduced a trap composed of 103 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:26:35] [INFO ] Deduced a trap composed of 169 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:26:35] [INFO ] Deduced a trap composed of 199 places in 464 ms of which 5 ms to minimize.
[2024-05-24 17:26:36] [INFO ] Deduced a trap composed of 171 places in 470 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
[2024-05-24 17:26:36] [INFO ] Deduced a trap composed of 72 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:26:37] [INFO ] Deduced a trap composed of 198 places in 449 ms of which 5 ms to minimize.
[2024-05-24 17:26:37] [INFO ] Deduced a trap composed of 157 places in 466 ms of which 5 ms to minimize.
SMT process timed out in 5268ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 94 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1009 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (142 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 73368 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73368 steps, saw 30628 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:26:41] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:26:41] [INFO ] Invariant cache hit.
[2024-05-24 17:26:41] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2024-05-24 17:26:42] [INFO ] Deduced a trap composed of 89 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:26:42] [INFO ] Deduced a trap composed of 103 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:26:43] [INFO ] Deduced a trap composed of 87 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:26:43] [INFO ] Deduced a trap composed of 103 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:26:44] [INFO ] Deduced a trap composed of 169 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:26:44] [INFO ] Deduced a trap composed of 199 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:26:45] [INFO ] Deduced a trap composed of 171 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:26:45] [INFO ] Deduced a trap composed of 72 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:26:46] [INFO ] Deduced a trap composed of 198 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:26:46] [INFO ] Deduced a trap composed of 157 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:26:47] [INFO ] Deduced a trap composed of 174 places in 535 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/918 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:26:47] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:26:48] [INFO ] Deduced a trap composed of 27 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:26:49] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:26:49] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:26:49] [INFO ] Deduced a trap composed of 75 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 147 places in 479 ms of which 6 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 149 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:26:51] [INFO ] Deduced a trap composed of 152 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:26:51] [INFO ] Deduced a trap composed of 85 places in 449 ms of which 5 ms to minimize.
[2024-05-24 17:26:52] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:26:52] [INFO ] Deduced a trap composed of 75 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 90 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 95 places in 462 ms of which 5 ms to minimize.
[2024-05-24 17:26:54] [INFO ] Deduced a trap composed of 128 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:26:54] [INFO ] Deduced a trap composed of 135 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:26:55] [INFO ] Deduced a trap composed of 46 places in 478 ms of which 6 ms to minimize.
[2024-05-24 17:26:55] [INFO ] Deduced a trap composed of 115 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:26:56] [INFO ] Deduced a trap composed of 57 places in 540 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/946 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/958 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3313/4271 variables, 958/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4271 variables, 2173/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4271/4271 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16418 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 958/958 constraints, ReadFeed: 2173/2173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:26:58] [INFO ] Deduced a trap composed of 236 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:26:59] [INFO ] Deduced a trap composed of 73 places in 519 ms of which 5 ms to minimize.
[2024-05-24 17:26:59] [INFO ] Deduced a trap composed of 169 places in 522 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2024-05-24 17:27:00] [INFO ] Deduced a trap composed of 170 places in 521 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/918 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:27:00] [INFO ] Deduced a trap composed of 154 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:27:01] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:27:01] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 5 ms to minimize.
[2024-05-24 17:27:02] [INFO ] Deduced a trap composed of 90 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:27:02] [INFO ] Deduced a trap composed of 165 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:27:03] [INFO ] Deduced a trap composed of 218 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:27:03] [INFO ] Deduced a trap composed of 92 places in 471 ms of which 5 ms to minimize.
[2024-05-24 17:27:04] [INFO ] Deduced a trap composed of 178 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:27:04] [INFO ] Deduced a trap composed of 85 places in 534 ms of which 5 ms to minimize.
[2024-05-24 17:27:05] [INFO ] Deduced a trap composed of 92 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:27:05] [INFO ] Deduced a trap composed of 95 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:27:06] [INFO ] Deduced a trap composed of 92 places in 478 ms of which 6 ms to minimize.
[2024-05-24 17:27:06] [INFO ] Deduced a trap composed of 97 places in 445 ms of which 5 ms to minimize.
[2024-05-24 17:27:07] [INFO ] Deduced a trap composed of 92 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:27:07] [INFO ] Deduced a trap composed of 97 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:27:08] [INFO ] Deduced a trap composed of 108 places in 477 ms of which 6 ms to minimize.
[2024-05-24 17:27:08] [INFO ] Deduced a trap composed of 119 places in 457 ms of which 5 ms to minimize.
[2024-05-24 17:27:09] [INFO ] Deduced a trap composed of 101 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:27:09] [INFO ] Deduced a trap composed of 263 places in 445 ms of which 5 ms to minimize.
[2024-05-24 17:27:09] [INFO ] Deduced a trap composed of 235 places in 436 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/918 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:27:10] [INFO ] Deduced a trap composed of 94 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:27:10] [INFO ] Deduced a trap composed of 153 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:27:11] [INFO ] Deduced a trap composed of 78 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:27:11] [INFO ] Deduced a trap composed of 82 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:27:12] [INFO ] Deduced a trap composed of 101 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:27:12] [INFO ] Deduced a trap composed of 131 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:27:13] [INFO ] Deduced a trap composed of 60 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:27:13] [INFO ] Deduced a trap composed of 92 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:27:14] [INFO ] Deduced a trap composed of 70 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:27:14] [INFO ] Deduced a trap composed of 92 places in 449 ms of which 5 ms to minimize.
[2024-05-24 17:27:15] [INFO ] Deduced a trap composed of 64 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:27:15] [INFO ] Deduced a trap composed of 97 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:27:16] [INFO ] Deduced a trap composed of 80 places in 528 ms of which 5 ms to minimize.
[2024-05-24 17:27:17] [INFO ] Deduced a trap composed of 64 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:27:17] [INFO ] Deduced a trap composed of 102 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:27:18] [INFO ] Deduced a trap composed of 72 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:27:18] [INFO ] Deduced a trap composed of 106 places in 443 ms of which 6 ms to minimize.
[2024-05-24 17:27:18] [INFO ] Deduced a trap composed of 260 places in 430 ms of which 6 ms to minimize.
[2024-05-24 17:27:19] [INFO ] Deduced a trap composed of 187 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:27:20] [INFO ] Deduced a trap composed of 78 places in 535 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2024-05-24 17:27:20] [INFO ] Flatten gal took : 194 ms
[2024-05-24 17:27:20] [INFO ] Applying decomposition
[2024-05-24 17:27:20] [INFO ] Flatten gal took : 237 ms
[2024-05-24 17:27:20] [INFO ] Deduced a trap composed of 71 places in 727 ms of which 6 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7311801030893018601.txt' '-o' '/tmp/graph7311801030893018601.bin' '-w' '/tmp/graph7311801030893018601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7311801030893018601.bin' '-l' '-1' '-v' '-w' '/tmp/graph7311801030893018601.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:27:21] [INFO ] Decomposing Gal with order
[2024-05-24 17:27:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:27:22] [INFO ] Deduced a trap composed of 82 places in 1532 ms of which 6 ms to minimize.
[2024-05-24 17:27:22] [INFO ] Removed a total of 6481 redundant transitions.
[2024-05-24 17:27:22] [INFO ] Flatten gal took : 1214 ms
[2024-05-24 17:27:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2717 labels/synchronizations in 261 ms.
[2024-05-24 17:27:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17927156321074131346.gal : 184 ms
[2024-05-24 17:27:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality947614315898926055.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17927156321074131346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality947614315898926055.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-24 17:27:23] [INFO ] Deduced a trap composed of 267 places in 1286 ms of which 14 ms to minimize.
Loading property file /tmp/ReachabilityCardinality947614315898926055.prop.
[2024-05-24 17:27:24] [INFO ] Deduced a trap composed of 221 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:27:24] [INFO ] Deduced a trap composed of 223 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 71 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 225 places in 466 ms of which 5 ms to minimize.
[2024-05-24 17:27:26] [INFO ] Deduced a trap composed of 113 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:27:26] [INFO ] Deduced a trap composed of 67 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 93 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 235 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:27:28] [INFO ] Deduced a trap composed of 198 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:27:28] [INFO ] Deduced a trap composed of 112 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:27:29] [INFO ] Deduced a trap composed of 69 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:27:29] [INFO ] Deduced a trap composed of 68 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 86 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 113 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:27:31] [INFO ] Deduced a trap composed of 122 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:27:32] [INFO ] Deduced a trap composed of 61 places in 580 ms of which 5 ms to minimize.
[2024-05-24 17:27:32] [INFO ] Deduced a trap composed of 62 places in 555 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 71 places in 590 ms of which 8 ms to minimize.
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 203 places in 535 ms of which 5 ms to minimize.
[2024-05-24 17:27:34] [INFO ] Deduced a trap composed of 94 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:27:34] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:27:35] [INFO ] Deduced a trap composed of 69 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 113 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 68 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:27:37] [INFO ] Deduced a trap composed of 88 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:27:37] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 62 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 104 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:27:39] [INFO ] Deduced a trap composed of 76 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:27:39] [INFO ] Deduced a trap composed of 244 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:27:40] [INFO ] Deduced a trap composed of 94 places in 603 ms of which 5 ms to minimize.
[2024-05-24 17:27:41] [INFO ] Deduced a trap composed of 66 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:27:41] [INFO ] Deduced a trap composed of 67 places in 542 ms of which 5 ms to minimize.
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 67 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 68 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:27:43] [INFO ] Deduced a trap composed of 94 places in 546 ms of which 7 ms to minimize.
SMT process timed out in 61982ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 102 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 135 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:27:43] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:27:43] [INFO ] Invariant cache hit.
[2024-05-24 17:27:44] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-24 17:27:44] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:27:44] [INFO ] Invariant cache hit.
[2024-05-24 17:27:45] [INFO ] State equation strengthened by 2173 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-24 17:28:16] [INFO ] Performed 951/958 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:28:16] [INFO ] Implicit Places using invariants and state equation in 32017 ms returned []
Implicit Place search using SMT with State Equation took 33222 ms to find 0 implicit places.
[2024-05-24 17:28:16] [INFO ] Redundant transitions in 162 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:28:16] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:28:16] [INFO ] Invariant cache hit.
[2024-05-24 17:28:17] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 51827ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 51864ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85415 ms. Remains : 958/958 places, 3711/3711 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:29:08] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (282 resets) in 154 ms. (64 steps per ms)
BEST_FIRST walk for 10001 steps (36 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:29:09] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:09] [INFO ] Invariant cache hit.
[2024-05-24 17:29:09] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:29:09] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:29:09] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-24 17:29:09] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:29:10] [INFO ] [Real]Added 2173 Read/Feed constraints in 411 ms returned sat
[2024-05-24 17:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:29:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:29:10] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:29:11] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-24 17:29:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 17:29:12] [INFO ] [Nat]Added 2173 Read/Feed constraints in 917 ms returned sat
[2024-05-24 17:29:12] [INFO ] Deduced a trap composed of 93 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Deduced a trap composed of 235 places in 491 ms of which 7 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1277 ms
[2024-05-24 17:29:13] [INFO ] Computed and/alt/rep : 1324/1905/1324 causal constraints (skipped 1927 transitions) in 184 ms.
[2024-05-24 17:29:14] [INFO ] Added : 13 causal constraints over 3 iterations in 723 ms. Result :sat
Minimization took 1260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 98 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 958/958 places, 3711/3711 transitions.
[2024-05-24 17:29:15] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28283 resets) in 15031 ms. (66 steps per ms)
BEST_FIRST walk for 1000000 steps (3594 resets) in 2568 ms. (389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:29:33] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:33] [INFO ] Invariant cache hit.
[2024-05-24 17:29:33] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:29:33] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:29:33] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2024-05-24 17:29:34] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:29:34] [INFO ] [Real]Added 2173 Read/Feed constraints in 414 ms returned sat
[2024-05-24 17:29:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:29:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:29:34] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-24 17:29:35] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-05-24 17:29:36] [INFO ] [Nat]Added 2173 Read/Feed constraints in 895 ms returned sat
[2024-05-24 17:29:36] [INFO ] Deduced a trap composed of 93 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:29:37] [INFO ] Deduced a trap composed of 235 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:29:38] [INFO ] Deduced a trap composed of 126 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:29:38] [INFO ] Deduced a trap composed of 57 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:29:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2509 ms
[2024-05-24 17:29:38] [INFO ] Computed and/alt/rep : 1324/1905/1324 causal constraints (skipped 1927 transitions) in 187 ms.
[2024-05-24 17:29:39] [INFO ] Added : 13 causal constraints over 3 iterations in 714 ms. Result :sat
Minimization took 4864 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 97 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 102 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:29:44] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:44] [INFO ] Invariant cache hit.
[2024-05-24 17:29:45] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2024-05-24 17:29:45] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:45] [INFO ] Invariant cache hit.
[2024-05-24 17:29:46] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:30:15] [INFO ] Implicit Places using invariants and state equation in 30153 ms returned []
Implicit Place search using SMT with State Equation took 31267 ms to find 0 implicit places.
[2024-05-24 17:30:16] [INFO ] Redundant transitions in 152 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:30:16] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:30:16] [INFO ] Invariant cache hit.
[2024-05-24 17:30:16] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 52126ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 52159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83698 ms. Remains : 958/958 places, 3711/3711 transitions.
[2024-05-24 17:31:08] [INFO ] Flatten gal took : 203 ms
[2024-05-24 17:31:08] [INFO ] Flatten gal took : 106 ms
[2024-05-24 17:31:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12766699799943846127.gal : 21 ms
[2024-05-24 17:31:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7686191986818119623.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12766699799943846127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7686191986818119623.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1130 resets) in 1443 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7686191986818119623.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
Interrupted probabilistic random walk after 63195 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63195 steps, saw 26447 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 17:31:11] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:11] [INFO ] Invariant cache hit.
[2024-05-24 17:31:11] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
[2024-05-24 17:31:12] [INFO ] Deduced a trap composed of 89 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:31:13] [INFO ] Deduced a trap composed of 103 places in 556 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
[2024-05-24 17:31:13] [INFO ] Deduced a trap composed of 87 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:31:14] [INFO ] Deduced a trap composed of 103 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:31:14] [INFO ] Deduced a trap composed of 169 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:31:15] [INFO ] Deduced a trap composed of 199 places in 480 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
[2024-05-24 17:31:15] [INFO ] Deduced a trap composed of 171 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 198 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:31:17] [INFO ] Deduced a trap composed of 157 places in 488 ms of which 5 ms to minimize.
SMT process timed out in 5341ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 98 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1606 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Interrupted probabilistic random walk after 73760 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73760 steps, saw 30792 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:31:20] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:20] [INFO ] Invariant cache hit.
[2024-05-24 17:31:20] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:31:21] [INFO ] Deduced a trap composed of 89 places in 481 ms of which 5 ms to minimize.
[2024-05-24 17:31:22] [INFO ] Deduced a trap composed of 103 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:31:22] [INFO ] Deduced a trap composed of 87 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:31:23] [INFO ] Deduced a trap composed of 103 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:31:23] [INFO ] Deduced a trap composed of 169 places in 466 ms of which 5 ms to minimize.
[2024-05-24 17:31:24] [INFO ] Deduced a trap composed of 199 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:31:24] [INFO ] Deduced a trap composed of 171 places in 462 ms of which 5 ms to minimize.
[2024-05-24 17:31:25] [INFO ] Deduced a trap composed of 72 places in 465 ms of which 5 ms to minimize.
[2024-05-24 17:31:25] [INFO ] Deduced a trap composed of 198 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:31:26] [INFO ] Deduced a trap composed of 157 places in 465 ms of which 5 ms to minimize.
[2024-05-24 17:31:26] [INFO ] Deduced a trap composed of 174 places in 479 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/918 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:31:27] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:31:27] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:31:28] [INFO ] Deduced a trap composed of 46 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:31:28] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 6 ms to minimize.
[2024-05-24 17:31:29] [INFO ] Deduced a trap composed of 75 places in 435 ms of which 5 ms to minimize.
[2024-05-24 17:31:29] [INFO ] Deduced a trap composed of 147 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:31:30] [INFO ] Deduced a trap composed of 149 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:31:30] [INFO ] Deduced a trap composed of 152 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:31:30] [INFO ] Deduced a trap composed of 85 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:31:31] [INFO ] Deduced a trap composed of 141 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:31:31] [INFO ] Deduced a trap composed of 75 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:31:32] [INFO ] Deduced a trap composed of 90 places in 442 ms of which 5 ms to minimize.
[2024-05-24 17:31:32] [INFO ] Deduced a trap composed of 95 places in 425 ms of which 5 ms to minimize.
[2024-05-24 17:31:33] [INFO ] Deduced a trap composed of 128 places in 443 ms of which 6 ms to minimize.
[2024-05-24 17:31:33] [INFO ] Deduced a trap composed of 135 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:31:34] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 5 ms to minimize.
[2024-05-24 17:31:34] [INFO ] Deduced a trap composed of 115 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:31:35] [INFO ] Deduced a trap composed of 57 places in 524 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/946 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/958 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3313/4271 variables, 958/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4271 variables, 2173/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4271/4271 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15855 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 958/958 constraints, ReadFeed: 2173/2173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:31:37] [INFO ] Deduced a trap composed of 236 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:31:37] [INFO ] Deduced a trap composed of 73 places in 490 ms of which 5 ms to minimize.
[2024-05-24 17:31:38] [INFO ] Deduced a trap composed of 169 places in 489 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2024-05-24 17:31:38] [INFO ] Deduced a trap composed of 170 places in 481 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/918 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:31:39] [INFO ] Deduced a trap composed of 154 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:31:40] [INFO ] Deduced a trap composed of 46 places in 443 ms of which 5 ms to minimize.
[2024-05-24 17:31:40] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:31:40] [INFO ] Deduced a trap composed of 90 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:31:41] [INFO ] Deduced a trap composed of 165 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:31:41] [INFO ] Deduced a trap composed of 218 places in 481 ms of which 6 ms to minimize.
[2024-05-24 17:31:42] [INFO ] Deduced a trap composed of 92 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:31:42] [INFO ] Deduced a trap composed of 178 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:31:43] [INFO ] Deduced a trap composed of 85 places in 487 ms of which 6 ms to minimize.
[2024-05-24 17:31:43] [INFO ] Deduced a trap composed of 92 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:31:44] [INFO ] Deduced a trap composed of 95 places in 426 ms of which 5 ms to minimize.
[2024-05-24 17:31:44] [INFO ] Deduced a trap composed of 92 places in 434 ms of which 7 ms to minimize.
[2024-05-24 17:31:45] [INFO ] Deduced a trap composed of 97 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:31:45] [INFO ] Deduced a trap composed of 92 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:31:46] [INFO ] Deduced a trap composed of 97 places in 423 ms of which 5 ms to minimize.
[2024-05-24 17:31:46] [INFO ] Deduced a trap composed of 108 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:31:46] [INFO ] Deduced a trap composed of 119 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:31:47] [INFO ] Deduced a trap composed of 101 places in 423 ms of which 5 ms to minimize.
[2024-05-24 17:31:47] [INFO ] Deduced a trap composed of 263 places in 429 ms of which 5 ms to minimize.
[2024-05-24 17:31:48] [INFO ] Deduced a trap composed of 235 places in 421 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/918 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:31:48] [INFO ] Deduced a trap composed of 94 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:31:49] [INFO ] Deduced a trap composed of 153 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:31:49] [INFO ] Deduced a trap composed of 78 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:31:50] [INFO ] Deduced a trap composed of 82 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:31:50] [INFO ] Deduced a trap composed of 101 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:31:51] [INFO ] Deduced a trap composed of 131 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:31:51] [INFO ] Deduced a trap composed of 60 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:31:52] [INFO ] Deduced a trap composed of 92 places in 456 ms of which 5 ms to minimize.
[2024-05-24 17:31:52] [INFO ] Deduced a trap composed of 70 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:31:53] [INFO ] Deduced a trap composed of 92 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:31:53] [INFO ] Deduced a trap composed of 64 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:31:54] [INFO ] Deduced a trap composed of 97 places in 427 ms of which 6 ms to minimize.
[2024-05-24 17:31:54] [INFO ] Deduced a trap composed of 80 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:31:55] [INFO ] Deduced a trap composed of 64 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:31:55] [INFO ] Deduced a trap composed of 102 places in 573 ms of which 5 ms to minimize.
[2024-05-24 17:31:56] [INFO ] Deduced a trap composed of 72 places in 534 ms of which 5 ms to minimize.
[2024-05-24 17:31:56] [INFO ] Deduced a trap composed of 106 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:31:57] [INFO ] Deduced a trap composed of 260 places in 439 ms of which 14 ms to minimize.
[2024-05-24 17:31:57] [INFO ] Deduced a trap composed of 187 places in 472 ms of which 5 ms to minimize.
[2024-05-24 17:31:58] [INFO ] Deduced a trap composed of 78 places in 493 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2024-05-24 17:31:58] [INFO ] Flatten gal took : 96 ms
[2024-05-24 17:31:58] [INFO ] Applying decomposition
[2024-05-24 17:31:58] [INFO ] Flatten gal took : 102 ms
[2024-05-24 17:31:58] [INFO ] Deduced a trap composed of 71 places in 594 ms of which 5 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3072984941857339117.txt' '-o' '/tmp/graph3072984941857339117.bin' '-w' '/tmp/graph3072984941857339117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3072984941857339117.bin' '-l' '-1' '-v' '-w' '/tmp/graph3072984941857339117.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:31:59] [INFO ] Decomposing Gal with order
[2024-05-24 17:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:31:59] [INFO ] Removed a total of 6622 redundant transitions.
[2024-05-24 17:31:59] [INFO ] Flatten gal took : 401 ms
[2024-05-24 17:31:59] [INFO ] Deduced a trap composed of 82 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2703 labels/synchronizations in 171 ms.
[2024-05-24 17:31:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10671981282766697104.gal : 23 ms
[2024-05-24 17:31:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17050245368828621224.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10671981282766697104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17050245368828621224.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2024-05-24 17:32:00] [INFO ] Deduced a trap composed of 267 places in 520 ms of which 6 ms to minimize.
Loading property file /tmp/ReachabilityCardinality17050245368828621224.prop.
[2024-05-24 17:32:00] [INFO ] Deduced a trap composed of 221 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:32:01] [INFO ] Deduced a trap composed of 223 places in 431 ms of which 14 ms to minimize.
[2024-05-24 17:32:01] [INFO ] Deduced a trap composed of 71 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:32:02] [INFO ] Deduced a trap composed of 225 places in 427 ms of which 6 ms to minimize.
[2024-05-24 17:32:02] [INFO ] Deduced a trap composed of 113 places in 446 ms of which 5 ms to minimize.
[2024-05-24 17:32:03] [INFO ] Deduced a trap composed of 67 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:32:03] [INFO ] Deduced a trap composed of 93 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:32:04] [INFO ] Deduced a trap composed of 235 places in 430 ms of which 6 ms to minimize.
[2024-05-24 17:32:04] [INFO ] Deduced a trap composed of 198 places in 487 ms of which 6 ms to minimize.
[2024-05-24 17:32:05] [INFO ] Deduced a trap composed of 112 places in 553 ms of which 15 ms to minimize.
[2024-05-24 17:32:05] [INFO ] Deduced a trap composed of 69 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:32:06] [INFO ] Deduced a trap composed of 68 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:32:06] [INFO ] Deduced a trap composed of 86 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:32:07] [INFO ] Deduced a trap composed of 113 places in 484 ms of which 6 ms to minimize.
[2024-05-24 17:32:07] [INFO ] Deduced a trap composed of 122 places in 476 ms of which 6 ms to minimize.
[2024-05-24 17:32:08] [INFO ] Deduced a trap composed of 61 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:32:08] [INFO ] Deduced a trap composed of 62 places in 506 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:32:09] [INFO ] Deduced a trap composed of 71 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:32:10] [INFO ] Deduced a trap composed of 203 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:32:10] [INFO ] Deduced a trap composed of 94 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:32:11] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:32:11] [INFO ] Deduced a trap composed of 69 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:32:12] [INFO ] Deduced a trap composed of 113 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:32:12] [INFO ] Deduced a trap composed of 68 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:32:13] [INFO ] Deduced a trap composed of 88 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:32:13] [INFO ] Deduced a trap composed of 88 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:32:14] [INFO ] Deduced a trap composed of 62 places in 489 ms of which 5 ms to minimize.
[2024-05-24 17:32:14] [INFO ] Deduced a trap composed of 104 places in 500 ms of which 8 ms to minimize.
[2024-05-24 17:32:15] [INFO ] Deduced a trap composed of 76 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:32:15] [INFO ] Deduced a trap composed of 244 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:32:16] [INFO ] Deduced a trap composed of 94 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:32:16] [INFO ] Deduced a trap composed of 66 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:32:17] [INFO ] Deduced a trap composed of 67 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:32:17] [INFO ] Deduced a trap composed of 67 places in 483 ms of which 5 ms to minimize.
[2024-05-24 17:32:18] [INFO ] Deduced a trap composed of 68 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:32:18] [INFO ] Deduced a trap composed of 94 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:32:19] [INFO ] Deduced a trap composed of 120 places in 521 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/918 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:32:19] [INFO ] Deduced a trap composed of 46 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:32:20] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:32:20] [INFO ] Deduced a trap composed of 71 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:32:21] [INFO ] Deduced a trap composed of 75 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:32:22] [INFO ] Deduced a trap composed of 71 places in 502 ms of which 5 ms to minimize.
SMT process timed out in 61145ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 97 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 94 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:32:22] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:32:22] [INFO ] Invariant cache hit.
[2024-05-24 17:32:23] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-24 17:32:23] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:32:23] [INFO ] Invariant cache hit.
[2024-05-24 17:32:24] [INFO ] State equation strengthened by 2173 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-24 17:32:54] [INFO ] Implicit Places using invariants and state equation in 30713 ms returned []
Implicit Place search using SMT with State Equation took 31905 ms to find 0 implicit places.
[2024-05-24 17:32:54] [INFO ] Redundant transitions in 152 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:32:54] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:32:54] [INFO ] Invariant cache hit.
[2024-05-24 17:32:54] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 51584ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 51615ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83787 ms. Remains : 958/958 places, 3711/3711 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10 in 277109 ms.
[2024-05-24 17:33:46] [INFO ] Flatten gal took : 96 ms
[2024-05-24 17:33:46] [INFO ] Applying decomposition
[2024-05-24 17:33:46] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5394411157766890092.txt' '-o' '/tmp/graph5394411157766890092.bin' '-w' '/tmp/graph5394411157766890092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5394411157766890092.bin' '-l' '-1' '-v' '-w' '/tmp/graph5394411157766890092.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:33:46] [INFO ] Decomposing Gal with order
[2024-05-24 17:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:33:46] [INFO ] Removed a total of 6596 redundant transitions.
[2024-05-24 17:33:46] [INFO ] Flatten gal took : 395 ms
[2024-05-24 17:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2388 labels/synchronizations in 124 ms.
[2024-05-24 17:33:47] [INFO ] Time to serialize gal into /tmp/UpperBounds12089128449387589155.gal : 23 ms
[2024-05-24 17:33:47] [INFO ] Time to serialize properties into /tmp/UpperBounds14850249292092889281.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12089128449387589155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14850249292092889281.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds14850249292092889281.prop.
ITS-tools command line returned an error code 137
[2024-05-24 17:39:08] [INFO ] Flatten gal took : 105 ms
[2024-05-24 17:39:08] [INFO ] Time to serialize gal into /tmp/UpperBounds7683354712310197169.gal : 17 ms
[2024-05-24 17:39:08] [INFO ] Time to serialize properties into /tmp/UpperBounds6774579910760722098.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7683354712310197169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6774579910760722098.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6774579910760722098.prop.
ITS-tools command line returned an error code 137
[2024-05-24 17:45:36] [INFO ] Flatten gal took : 99 ms
[2024-05-24 17:45:36] [INFO ] Input system was already deterministic with 3711 transitions.
[2024-05-24 17:45:36] [INFO ] Transformed 958 places.
[2024-05-24 17:45:36] [INFO ] Transformed 3711 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 17:45:36] [INFO ] Time to serialize gal into /tmp/UpperBounds3791982003546529679.gal : 14 ms
[2024-05-24 17:45:36] [INFO ] Time to serialize properties into /tmp/UpperBounds5748661052709642873.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3791982003546529679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5748661052709642873.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5748661052709642873.prop.
ITS-tools command line returned an error code 137
Total runtime 1824018 ms.

BK_STOP 1716573131557

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;