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.r092-tall-171624189500565.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 DBSingleClientW-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 DBSingleClientW-PT-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716327049158

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 21:30:50] [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-21 21:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:30:50] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-21 21:30:50] [INFO ] Transformed 4763 places.
[2024-05-21 21:30:50] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:30:50] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 33 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:30:50] [INFO ] Computed 6 invariants in 147 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
RANDOM walk for 10000 steps (2314 resets) in 375 ms. (26 steps per ms)
BEST_FIRST walk for 40001 steps (3642 resets) in 236 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[6, 6, 7, 6]
[2024-05-21 21:30:51] [INFO ] Invariant cache hit.
[2024-05-21 21:30:51] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2024-05-21 21:30:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned unsat
[2024-05-21 21:30:52] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:30:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:30:52] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-05-21 21:30:53] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:30:53] [INFO ] [Real]Added 1588 Read/Feed constraints in 778 ms returned sat
[2024-05-21 21:30:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:30:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:30:54] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2024-05-21 21:30:55] [INFO ] [Nat]Added 1588 Read/Feed constraints in 725 ms returned sat
[2024-05-21 21:30:56] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 751 ms.
[2024-05-21 21:30:56] [INFO ] Added : 6 causal constraints over 2 iterations in 1260 ms. Result :sat
Minimization took 639 ms.
[2024-05-21 21:30:57] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:30:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 21:30:58] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-21 21:30:59] [INFO ] [Real]Added 1588 Read/Feed constraints in 729 ms returned sat
[2024-05-21 21:30:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:30:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 21:30:59] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-21 21:31:00] [INFO ] [Nat]Added 1588 Read/Feed constraints in 829 ms returned sat
[2024-05-21 21:31:01] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 598 ms.
[2024-05-21 21:31:01] [INFO ] Added : 10 causal constraints over 2 iterations in 1064 ms. Result :sat
Minimization took 620 ms.
[2024-05-21 21:31:02] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:31:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:31:03] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-05-21 21:31:04] [INFO ] [Real]Added 1588 Read/Feed constraints in 716 ms returned sat
[2024-05-21 21:31:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:31:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:31:04] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2024-05-21 21:31:05] [INFO ] [Nat]Added 1588 Read/Feed constraints in 901 ms returned sat
[2024-05-21 21:31:06] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 379 ms.
[2024-05-21 21:31:07] [INFO ] Deduced a trap composed of 33 places in 744 ms of which 62 ms to minimize.
[2024-05-21 21:31:08] [INFO ] Deduced a trap composed of 48 places in 727 ms of which 14 ms to minimize.
[2024-05-21 21:31:09] [INFO ] Deduced a trap composed of 56 places in 687 ms of which 9 ms to minimize.
[2024-05-21 21:31:09] [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 3
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 6, 7, 6]
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1318 place count 434 transition count 880
Iterating global reduction 2 with 313 rules applied. Total rules applied 1631 place count 434 transition count 880
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 434 transition count 868
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1882 place count 195 transition count 534
Iterating global reduction 3 with 239 rules applied. Total rules applied 2121 place count 195 transition count 534
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2331 place count 195 transition count 324
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2354 place count 172 transition count 286
Iterating global reduction 4 with 23 rules applied. Total rules applied 2377 place count 172 transition count 286
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2383 place count 172 transition count 280
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2398 place count 157 transition count 265
Iterating global reduction 5 with 15 rules applied. Total rules applied 2413 place count 157 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2416 place count 157 transition count 262
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2429 place count 144 transition count 249
Iterating global reduction 6 with 13 rules applied. Total rules applied 2442 place count 144 transition count 249
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2452 place count 144 transition count 239
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2457 place count 139 transition count 215
Iterating global reduction 7 with 5 rules applied. Total rules applied 2462 place count 139 transition count 215
Applied a total of 2462 rules in 301 ms. Remains 139 /1183 variables (removed 1044) and now considering 215/2478 (removed 2263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 139/1183 places, 215/2478 transitions.
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:31:09] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
RANDOM walk for 1000000 steps (229712 resets) in 1385 ms. (721 steps per ms)
BEST_FIRST walk for 3000002 steps (286211 resets) in 1873 ms. (1600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
[2024-05-21 21:31:13] [INFO ] Invariant cache hit.
[2024-05-21 21:31:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:31:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:31:13] [INFO ] [Real]Added 79 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Nat]Added 79 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:31:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:31:13] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 21:31:13] [INFO ] Added : 16 causal constraints over 4 iterations in 179 ms. Result :sat
Minimization took 188 ms.
[2024-05-21 21:31:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Real]Added 79 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:31:13] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:31:14] [INFO ] [Nat]Added 79 Read/Feed constraints in 27 ms returned sat
[2024-05-21 21:31:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:31:14] [INFO ] Added : 15 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 142 ms.
[2024-05-21 21:31:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:31:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:31:14] [INFO ] [Real]Added 79 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:31:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:31:14] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:31:14] [INFO ] [Nat]Added 79 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:31:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 11 ms.
[2024-05-21 21:31:14] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:31:14] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-05-21 21:31:14] [INFO ] Added : 23 causal constraints over 6 iterations in 301 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 139/139 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 15 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 21:31:15] [INFO ] Invariant cache hit.
[2024-05-21 21:31:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:31:15] [INFO ] Invariant cache hit.
[2024-05-21 21:31:15] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:31:15] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-05-21 21:31:15] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-21 21:31:15] [INFO ] Invariant cache hit.
[2024-05-21 21:31:15] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/354 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 220 constraints, problems are : Problem set: 0 solved, 214 unsolved in 7482 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/354 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 214/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 434 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15077 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 22991ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23014ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23660 ms. Remains : 139/139 places, 215/215 transitions.
RANDOM walk for 40000 steps (9229 resets) in 1253 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3778 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
[2024-05-21 21:31:39] [INFO ] Flatten gal took : 106 ms
[2024-05-21 21:31:39] [INFO ] Flatten gal took : 30 ms
BEST_FIRST walk for 40002 steps (3794 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3809 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
[2024-05-21 21:31:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4819643137007402882.gal : 24 ms
[2024-05-21 21:31:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6361532513698397445.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/ReachabilityCardinality4819643137007402882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6361532513698397445.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (3776 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
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 ...328
BEST_FIRST walk for 40002 steps (3822 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality6361532513698397445.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40004 steps (3830 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :182 after 324
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :324 after 534
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :534 after 2302
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2302 after 4656
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4656 after 23997
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :23997 after 70928
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :70928 after 188201
Interrupted probabilistic random walk after 805161 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :3 out of 6
Probabilistic random walk after 805161 steps, saw 312873 distinct states, run finished after 3004 ms. (steps per millisecond=268 ) properties seen :3
[2024-05-21 21:31:42] [INFO ] Invariant cache hit.
[2024-05-21 21:31:42] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/249 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 7 (OVERLAPS) 98/347 variables, 35/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 76/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/354 variables, 4/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 3/220 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 29 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 354/354 variables, and 221 constraints, problems are : Problem set: 3 solved, 0 unsolved in 380 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 399ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-21 21:31:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2302 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (987 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 21:31:43] [INFO ] Invariant cache hit.
[2024-05-21 21:31:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 21:31:43] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-21 21:31:43] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:31:43] [INFO ] [Real]Added 79 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:31:43] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:31:43] [INFO ] [Nat]Added 79 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:31:43] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-21 21:31:43] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2024-05-21 21:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-05-21 21:31:43] [INFO ] Added : 16 causal constraints over 4 iterations in 341 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 131 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 128 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 128 transition count 178
Applied a total of 28 rules in 30 ms. Remains 128 /139 variables (removed 11) and now considering 178/215 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 128/139 places, 178/215 transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 21:31:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229684 resets) in 1168 ms. (855 steps per ms)
BEST_FIRST walk for 1000000 steps (94660 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 21:31:45] [INFO ] Invariant cache hit.
[2024-05-21 21:31:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:31:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:31:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:31:45] [INFO ] [Real]Added 51 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:31:45] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:31:45] [INFO ] [Nat]Added 51 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:31:45] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 11 ms.
[2024-05-21 21:31:45] [INFO ] Added : 18 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 21:31:46] [INFO ] Invariant cache hit.
[2024-05-21 21:31:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:31:46] [INFO ] Invariant cache hit.
[2024-05-21 21:31:46] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:31:46] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-21 21:31:46] [INFO ] Redundant transitions in 4 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 21:31:46] [INFO ] Invariant cache hit.
[2024-05-21 21:31:46] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 181 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4664 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 11604 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 16504ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 16507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16893 ms. Remains : 128/128 places, 178/178 transitions.
RANDOM walk for 40000 steps (9158 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
[2024-05-21 21:32:03] [INFO ] Flatten gal took : 43 ms
BEST_FIRST walk for 40002 steps (3800 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2024-05-21 21:32:03] [INFO ] Flatten gal took : 27 ms
BEST_FIRST walk for 40003 steps (3878 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2024-05-21 21:32:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12544183898758589611.gal : 25 ms
[2024-05-21 21:32:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14958255869151751727.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/ReachabilityCardinality12544183898758589611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14958255869151751727.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 ...330
Loading property file /tmp/ReachabilityCardinality14958255869151751727.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 218
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :218 after 372
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :372 after 792
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :792 after 2552
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2552 after 9998
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9998 after 35627
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35627 after 131036
Interrupted probabilistic random walk after 2471395 steps, run timeout after 3001 ms. (steps per millisecond=823 ) properties seen :1 out of 2
Probabilistic random walk after 2471395 steps, saw 1000708 distinct states, run finished after 3001 ms. (steps per millisecond=823 ) properties seen :1
[2024-05-21 21:32:06] [INFO ] Invariant cache hit.
[2024-05-21 21:32:06] [INFO ] State equation strengthened by 51 read => feed constraints.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 8192
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :131036 after 325911
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/141 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/217 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/232 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/306 variables, 57/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:32:06] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 306/306 variables, and 182 constraints, problems are : Problem set: 1 solved, 0 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 197ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 23277 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-07
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:32:06] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2326 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10000 steps (952 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:32:06] [INFO ] Invariant cache hit.
[2024-05-21 21:32:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:32:06] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:32:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:32:06] [INFO ] [Real]Added 79 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:32:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:32:06] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:32:06] [INFO ] [Nat]Added 79 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:32:06] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 12 ms.
[2024-05-21 21:32:06] [INFO ] Added : 15 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 133 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 133 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 131 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 131 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 129 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 129 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 129 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 128 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 128 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 128 transition count 193
Applied a total of 26 rules in 21 ms. Remains 128 /139 variables (removed 11) and now considering 193/215 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 128/139 places, 193/215 transitions.
// Phase 1: matrix 193 rows 128 cols
[2024-05-21 21:32:06] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229869 resets) in 1249 ms. (800 steps per ms)
BEST_FIRST walk for 1000001 steps (95414 resets) in 570 ms. (1751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:32:08] [INFO ] Invariant cache hit.
[2024-05-21 21:32:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:32:08] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:32:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 21:32:08] [INFO ] [Real]Added 72 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:32:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:32:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:32:08] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:32:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:32:08] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 12 ms.
[2024-05-21 21:32:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 21:32:08] [INFO ] Added : 19 causal constraints over 4 iterations in 177 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-21 21:32:09] [INFO ] Redundant transitions in 2 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 202 constraints, problems are : Problem set: 0 solved, 192 unsolved in 5283 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 192/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 394 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11041 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 16560ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 16562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16949 ms. Remains : 128/128 places, 193/193 transitions.
RANDOM walk for 40000 steps (9197 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3751 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
[2024-05-21 21:32:26] [INFO ] Flatten gal took : 35 ms
BEST_FIRST walk for 40002 steps (3863 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2024-05-21 21:32:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:32:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2222222472357309566.gal : 5 ms
[2024-05-21 21:32:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9464192185137625230.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/ReachabilityCardinality2222222472357309566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9464192185137625230.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 ...328
Loading property file /tmp/ReachabilityCardinality9464192185137625230.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 500
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :500 after 1966
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1966 after 4545
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4545 after 16287
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16287 after 113067
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :113067 after 254275
Interrupted probabilistic random walk after 2305237 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :1 out of 2
Probabilistic random walk after 2305237 steps, saw 937443 distinct states, run finished after 3001 ms. (steps per millisecond=768 ) properties seen :1
[2024-05-21 21:32:29] [INFO ] Invariant cache hit.
[2024-05-21 21:32:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/220 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 312/321 variables, and 125 constraints, problems are : Problem set: 1 solved, 0 unsolved in 81 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/128 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-07 in 23027 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:32:29] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2307 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (974 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 21:32:29] [INFO ] Invariant cache hit.
[2024-05-21 21:32:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:32:29] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:32:29] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:32:29] [INFO ] [Real]Added 79 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:32:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:32:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:32:29] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:32:29] [INFO ] [Nat]Added 79 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:32:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 12 ms.
[2024-05-21 21:32:29] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:32:29] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:32:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-05-21 21:32:29] [INFO ] Added : 23 causal constraints over 6 iterations in 304 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 132 transition count 200
Applied a total of 18 rules in 20 ms. Remains 132 /139 variables (removed 7) and now considering 200/215 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 132/139 places, 200/215 transitions.
// Phase 1: matrix 200 rows 132 cols
[2024-05-21 21:32:30] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (230163 resets) in 1244 ms. (803 steps per ms)
BEST_FIRST walk for 1000000 steps (95339 resets) in 572 ms. (1745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 21:32:31] [INFO ] Invariant cache hit.
[2024-05-21 21:32:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:32:31] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:32:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:32:31] [INFO ] [Real]Added 74 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:32:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:32:32] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:32:32] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:32:32] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 12 ms.
[2024-05-21 21:32:32] [INFO ] Added : 12 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-21 21:32:32] [INFO ] Invariant cache hit.
[2024-05-21 21:32:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:32:32] [INFO ] Invariant cache hit.
[2024-05-21 21:32:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:32:32] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-21 21:32:32] [INFO ] Redundant transitions in 3 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-21 21:32:32] [INFO ] Invariant cache hit.
[2024-05-21 21:32:32] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 208 constraints, problems are : Problem set: 0 solved, 199 unsolved in 6452 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 199/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 407 constraints, problems are : Problem set: 0 solved, 199 unsolved in 15038 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 21740ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 21743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22170 ms. Remains : 132/132 places, 200/200 transitions.
[2024-05-21 21:32:54] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:32:54] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:32:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5662843913325509812.gal : 2 ms
[2024-05-21 21:32:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6694894998676845956.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/ReachabilityCardinality5662843913325509812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6694894998676845956.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 ...328
Loading property file /tmp/ReachabilityCardinality6694894998676845956.prop.
RANDOM walk for 40000 steps (9177 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40001 steps (3873 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 324
BEST_FIRST walk for 40002 steps (3859 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :324 after 534
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :534 after 2500
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2500 after 5471
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5471 after 25916
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :25916 after 114310
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :114310 after 258203
Interrupted probabilistic random walk after 2357824 steps, run timeout after 3001 ms. (steps per millisecond=785 ) properties seen :1 out of 2
Probabilistic random walk after 2357824 steps, saw 936803 distinct states, run finished after 3001 ms. (steps per millisecond=785 ) properties seen :1
[2024-05-21 21:32:57] [INFO ] Invariant cache hit.
[2024-05-21 21:32:57] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 137/231 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 323/332 variables, and 129 constraints, problems are : Problem set: 1 solved, 0 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/132 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14 in 28456 ms.
[2024-05-21 21:32:57] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:32:57] [INFO ] Applying decomposition
[2024-05-21 21:32:57] [INFO ] Flatten gal took : 11 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/graph3157100692990195773.txt' '-o' '/tmp/graph3157100692990195773.bin' '-w' '/tmp/graph3157100692990195773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3157100692990195773.bin' '-l' '-1' '-v' '-w' '/tmp/graph3157100692990195773.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:32:57] [INFO ] Decomposing Gal with order
[2024-05-21 21:32:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:32:57] [INFO ] Removed a total of 231 redundant transitions.
[2024-05-21 21:32:58] [INFO ] Flatten gal took : 60 ms
[2024-05-21 21:32:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 22 ms.
[2024-05-21 21:32:58] [INFO ] Time to serialize gal into /tmp/UpperBounds17529086444017703911.gal : 13 ms
[2024-05-21 21:32:58] [INFO ] Time to serialize properties into /tmp/UpperBounds8242921803752857532.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/UpperBounds17529086444017703911.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8242921803752857532.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 ...284
Loading property file /tmp/UpperBounds8242921803752857532.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.498e+06,11.4091,291552,2949,1880,165478,117543,642,1.93798e+06,224,1.58016e+06,0
Total reachable state count : 3498000

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-04 :0 <= i2.u5.l4143 <= 3
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-04,0,11.7012,291552,1,0,165478,117543,769,1.93798e+06,257,1.58016e+06,1934
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-07 :0 <= i3.u9.p49 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-07,0,11.7624,291552,1,0,165478,117543,798,1.93798e+06,277,1.58016e+06,2100
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-14 :0 <= i0.u12.l2315 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-14,0,11.7805,291552,1,0,165478,117543,816,1.93798e+06,282,1.58016e+06,2759
Total runtime 139658 ms.

BK_STOP 1716327189997

--------------------
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="DBSingleClientW-PT-d2m06"
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 DBSingleClientW-PT-d2m06, 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 r092-tall-171624189500565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 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 ;