./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:52:34,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:52:34,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:52:34,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:52:34,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:52:34,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:52:34,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:52:34,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:52:34,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:52:34,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:52:34,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:52:34,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:52:34,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:52:34,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:52:34,284 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:52:34,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:52:34,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:52:34,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:52:34,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:52:34,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:52:34,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:52:34,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:52:34,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:52:34,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:52:34,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:52:34,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:52:34,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:52:34,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:52:34,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:52:34,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:52:34,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:52:34,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:52:34,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:52:34,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:52:34,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:52:34,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:52:34,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:52:34,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:52:34,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:52:34,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:52:34,291 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:52:34,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:52:34,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:52:34,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2024-01-27 15:52:34,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:52:34,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:52:34,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:52:34,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:52:34,549 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:52:34,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-01-27 15:52:35,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:52:35,766 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:52:35,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-01-27 15:52:35,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364cb91f4/b36462dfb6cd498984085fc86381fcd0/FLAG051e0e113 [2024-01-27 15:52:35,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364cb91f4/b36462dfb6cd498984085fc86381fcd0 [2024-01-27 15:52:35,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:52:35,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:52:35,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:52:35,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:52:35,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:52:35,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:52:35" (1/1) ... [2024-01-27 15:52:35,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307b57fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:35, skipping insertion in model container [2024-01-27 15:52:35,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:52:35" (1/1) ... [2024-01-27 15:52:35,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:52:36,001 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-01-27 15:52:36,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:52:36,013 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:52:36,030 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-01-27 15:52:36,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:52:36,057 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:52:36,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36 WrapperNode [2024-01-27 15:52:36,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:52:36,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:52:36,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:52:36,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:52:36,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,093 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-01-27 15:52:36,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:52:36,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:52:36,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:52:36,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:52:36,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,121 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 15:52:36,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:52:36,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:52:36,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:52:36,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:52:36,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (1/1) ... [2024-01-27 15:52:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:52:36,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:36,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:52:36,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:52:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:52:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:52:36,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:52:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:52:36,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:52:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:52:36,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:52:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:52:36,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:52:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:52:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:52:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:52:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:52:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:52:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:52:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:52:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:52:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:52:36,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:52:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:52:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:52:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:52:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:52:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:52:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:52:36,314 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:52:36,434 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:52:36,436 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:52:36,672 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:52:36,672 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:52:36,924 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:52:36,924 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:52:36,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:52:36 BoogieIcfgContainer [2024-01-27 15:52:36,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:52:36,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:52:36,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:52:36,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:52:36,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:52:35" (1/3) ... [2024-01-27 15:52:36,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fa748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:52:36, skipping insertion in model container [2024-01-27 15:52:36,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:52:36" (2/3) ... [2024-01-27 15:52:36,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fa748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:52:36, skipping insertion in model container [2024-01-27 15:52:36,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:52:36" (3/3) ... [2024-01-27 15:52:36,931 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-01-27 15:52:36,940 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:52:36,947 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:52:36,948 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:52:36,948 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:52:37,004 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:52:37,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 106 flow [2024-01-27 15:52:37,065 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-01-27 15:52:37,065 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:52:37,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 4/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-01-27 15:52:37,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 106 flow [2024-01-27 15:52:37,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 92 flow [2024-01-27 15:52:37,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:52:37,088 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ba2fa71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:52:37,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:52:37,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:52:37,115 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-01-27 15:52:37,115 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:52:37,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:37,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:37,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:37,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash 855894444, now seen corresponding path program 1 times [2024-01-27 15:52:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773837] [2024-01-27 15:52:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:37,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773837] [2024-01-27 15:52:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773837] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:37,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:37,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:52:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442248850] [2024-01-27 15:52:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:52:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:37,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:52:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:52:37,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:52:37,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:37,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:37,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:52:37,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:37,712 INFO L124 PetriNetUnfolderBase]: 1343/1928 cut-off events. [2024-01-27 15:52:37,712 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-01-27 15:52:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 1928 events. 1343/1928 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8367 event pairs, 215 based on Foata normal form. 57/1973 useless extension candidates. Maximal degree in co-relation 2858. Up to 1515 conditions per place. [2024-01-27 15:52:37,729 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 3 changer transitions 3/54 dead transitions. [2024-01-27 15:52:37,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 243 flow [2024-01-27 15:52:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:52:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:52:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-27 15:52:37,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-01-27 15:52:37,740 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 92 flow. Second operand 3 states and 87 transitions. [2024-01-27 15:52:37,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 243 flow [2024-01-27 15:52:37,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 15:52:37,750 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 99 flow [2024-01-27 15:52:37,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-01-27 15:52:37,755 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-01-27 15:52:37,755 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 99 flow [2024-01-27 15:52:37,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:37,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:37,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:37,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:52:37,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:37,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2127251182, now seen corresponding path program 1 times [2024-01-27 15:52:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268409751] [2024-01-27 15:52:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:37,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268409751] [2024-01-27 15:52:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268409751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:37,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:37,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485750795] [2024-01-27 15:52:37,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:37,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:37,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-27 15:52:37,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:37,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:37,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-27 15:52:37,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:38,207 INFO L124 PetriNetUnfolderBase]: 1995/2834 cut-off events. [2024-01-27 15:52:38,207 INFO L125 PetriNetUnfolderBase]: For 734/736 co-relation queries the response was YES. [2024-01-27 15:52:38,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 2834 events. 1995/2834 cut-off events. For 734/736 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13053 event pairs, 187 based on Foata normal form. 0/2673 useless extension candidates. Maximal degree in co-relation 3540. Up to 1025 conditions per place. [2024-01-27 15:52:38,221 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 72 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2024-01-27 15:52:38,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 86 transitions, 396 flow [2024-01-27 15:52:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-01-27 15:52:38,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-27 15:52:38,224 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 99 flow. Second operand 5 states and 135 transitions. [2024-01-27 15:52:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 86 transitions, 396 flow [2024-01-27 15:52:38,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 86 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:52:38,226 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 139 flow [2024-01-27 15:52:38,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-01-27 15:52:38,227 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-01-27 15:52:38,227 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 139 flow [2024-01-27 15:52:38,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:38,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:38,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:38,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:52:38,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:38,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1112123600, now seen corresponding path program 2 times [2024-01-27 15:52:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117786061] [2024-01-27 15:52:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:38,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117786061] [2024-01-27 15:52:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117786061] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642246432] [2024-01-27 15:52:38,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:38,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:38,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:38,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:38,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:38,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:38,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:38,682 INFO L124 PetriNetUnfolderBase]: 3391/4764 cut-off events. [2024-01-27 15:52:38,682 INFO L125 PetriNetUnfolderBase]: For 3626/3626 co-relation queries the response was YES. [2024-01-27 15:52:38,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13096 conditions, 4764 events. 3391/4764 cut-off events. For 3626/3626 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 24078 event pairs, 597 based on Foata normal form. 0/4564 useless extension candidates. Maximal degree in co-relation 2609. Up to 1898 conditions per place. [2024-01-27 15:52:38,737 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 87 selfloop transitions, 10 changer transitions 3/107 dead transitions. [2024-01-27 15:52:38,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 107 transitions, 576 flow [2024-01-27 15:52:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-01-27 15:52:38,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2024-01-27 15:52:38,738 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 139 flow. Second operand 5 states and 137 transitions. [2024-01-27 15:52:38,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 107 transitions, 576 flow [2024-01-27 15:52:38,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 576 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:52:38,742 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 212 flow [2024-01-27 15:52:38,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-01-27 15:52:38,743 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-01-27 15:52:38,743 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 212 flow [2024-01-27 15:52:38,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:38,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:38,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:38,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:52:38,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:38,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash 306654674, now seen corresponding path program 1 times [2024-01-27 15:52:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:38,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649320281] [2024-01-27 15:52:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649320281] [2024-01-27 15:52:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649320281] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874522945] [2024-01-27 15:52:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:38,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:38,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:38,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:38,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:38,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:39,331 INFO L124 PetriNetUnfolderBase]: 3367/4712 cut-off events. [2024-01-27 15:52:39,331 INFO L125 PetriNetUnfolderBase]: For 5852/5929 co-relation queries the response was YES. [2024-01-27 15:52:39,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14911 conditions, 4712 events. 3367/4712 cut-off events. For 5852/5929 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 23645 event pairs, 687 based on Foata normal form. 35/4718 useless extension candidates. Maximal degree in co-relation 6214. Up to 3609 conditions per place. [2024-01-27 15:52:39,371 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 84 selfloop transitions, 10 changer transitions 10/111 dead transitions. [2024-01-27 15:52:39,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 111 transitions, 673 flow [2024-01-27 15:52:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-01-27 15:52:39,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2024-01-27 15:52:39,373 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 212 flow. Second operand 5 states and 138 transitions. [2024-01-27 15:52:39,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 111 transitions, 673 flow [2024-01-27 15:52:39,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 673 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:52:39,380 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 299 flow [2024-01-27 15:52:39,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-01-27 15:52:39,382 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-01-27 15:52:39,382 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 299 flow [2024-01-27 15:52:39,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:39,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:39,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:39,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:52:39,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:39,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 248278060, now seen corresponding path program 2 times [2024-01-27 15:52:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:39,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018646483] [2024-01-27 15:52:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018646483] [2024-01-27 15:52:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018646483] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574952582] [2024-01-27 15:52:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:39,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:39,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:39,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:39,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:39,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:39,981 INFO L124 PetriNetUnfolderBase]: 4655/6386 cut-off events. [2024-01-27 15:52:39,982 INFO L125 PetriNetUnfolderBase]: For 10900/11035 co-relation queries the response was YES. [2024-01-27 15:52:39,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21556 conditions, 6386 events. 4655/6386 cut-off events. For 10900/11035 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 32063 event pairs, 763 based on Foata normal form. 41/5729 useless extension candidates. Maximal degree in co-relation 16411. Up to 4468 conditions per place. [2024-01-27 15:52:40,062 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 89 selfloop transitions, 8 changer transitions 4/110 dead transitions. [2024-01-27 15:52:40,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 782 flow [2024-01-27 15:52:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-01-27 15:52:40,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2024-01-27 15:52:40,063 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 299 flow. Second operand 4 states and 109 transitions. [2024-01-27 15:52:40,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 782 flow [2024-01-27 15:52:40,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 767 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-27 15:52:40,069 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 353 flow [2024-01-27 15:52:40,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-01-27 15:52:40,070 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-01-27 15:52:40,070 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 353 flow [2024-01-27 15:52:40,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:40,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:40,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:52:40,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:40,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1487897458, now seen corresponding path program 3 times [2024-01-27 15:52:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101572045] [2024-01-27 15:52:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101572045] [2024-01-27 15:52:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101572045] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830003414] [2024-01-27 15:52:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:40,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-27 15:52:40,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:40,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:40,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-27 15:52:40,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:40,652 INFO L124 PetriNetUnfolderBase]: 2931/4230 cut-off events. [2024-01-27 15:52:40,652 INFO L125 PetriNetUnfolderBase]: For 9252/9971 co-relation queries the response was YES. [2024-01-27 15:52:40,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16210 conditions, 4230 events. 2931/4230 cut-off events. For 9252/9971 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21974 event pairs, 573 based on Foata normal form. 150/4291 useless extension candidates. Maximal degree in co-relation 13072. Up to 3043 conditions per place. [2024-01-27 15:52:40,693 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 73 selfloop transitions, 6 changer transitions 13/105 dead transitions. [2024-01-27 15:52:40,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 105 transitions, 692 flow [2024-01-27 15:52:40,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-01-27 15:52:40,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2024-01-27 15:52:40,695 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 353 flow. Second operand 5 states and 137 transitions. [2024-01-27 15:52:40,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 105 transitions, 692 flow [2024-01-27 15:52:40,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 677 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-27 15:52:40,714 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 325 flow [2024-01-27 15:52:40,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-01-27 15:52:40,717 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2024-01-27 15:52:40,717 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 325 flow [2024-01-27 15:52:40,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:40,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:40,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:40,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:52:40,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:40,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1961639272, now seen corresponding path program 3 times [2024-01-27 15:52:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:40,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214305615] [2024-01-27 15:52:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214305615] [2024-01-27 15:52:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214305615] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:40,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:40,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615015259] [2024-01-27 15:52:40,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:40,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:40,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-27 15:52:40,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:40,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:40,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-27 15:52:40,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:41,389 INFO L124 PetriNetUnfolderBase]: 4071/5667 cut-off events. [2024-01-27 15:52:41,390 INFO L125 PetriNetUnfolderBase]: For 11867/12220 co-relation queries the response was YES. [2024-01-27 15:52:41,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20311 conditions, 5667 events. 4071/5667 cut-off events. For 11867/12220 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 28667 event pairs, 996 based on Foata normal form. 107/5576 useless extension candidates. Maximal degree in co-relation 9932. Up to 4450 conditions per place. [2024-01-27 15:52:41,449 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 5 changer transitions 26/99 dead transitions. [2024-01-27 15:52:41,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 722 flow [2024-01-27 15:52:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-01-27 15:52:41,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2024-01-27 15:52:41,451 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 325 flow. Second operand 4 states and 107 transitions. [2024-01-27 15:52:41,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 722 flow [2024-01-27 15:52:41,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 698 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-27 15:52:41,459 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 332 flow [2024-01-27 15:52:41,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-01-27 15:52:41,460 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-01-27 15:52:41,460 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 332 flow [2024-01-27 15:52:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:41,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:41,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:52:41,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:41,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1349843010, now seen corresponding path program 4 times [2024-01-27 15:52:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:41,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115869342] [2024-01-27 15:52:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115869342] [2024-01-27 15:52:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115869342] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:41,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:41,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:52:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508519145] [2024-01-27 15:52:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:41,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:52:41,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:41,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:41,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:41,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:41,933 INFO L124 PetriNetUnfolderBase]: 3371/4567 cut-off events. [2024-01-27 15:52:41,934 INFO L125 PetriNetUnfolderBase]: For 10891/11122 co-relation queries the response was YES. [2024-01-27 15:52:41,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17862 conditions, 4567 events. 3371/4567 cut-off events. For 10891/11122 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 20870 event pairs, 941 based on Foata normal form. 82/4611 useless extension candidates. Maximal degree in co-relation 11872. Up to 4221 conditions per place. [2024-01-27 15:52:41,972 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 6 changer transitions 7/79 dead transitions. [2024-01-27 15:52:41,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 542 flow [2024-01-27 15:52:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-01-27 15:52:41,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2024-01-27 15:52:41,976 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 332 flow. Second operand 4 states and 99 transitions. [2024-01-27 15:52:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 542 flow [2024-01-27 15:52:41,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 526 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-27 15:52:41,984 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 298 flow [2024-01-27 15:52:41,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-01-27 15:52:41,984 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-01-27 15:52:41,985 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 298 flow [2024-01-27 15:52:41,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:41,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:41,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:41,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:52:41,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:41,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1526601998, now seen corresponding path program 5 times [2024-01-27 15:52:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864328507] [2024-01-27 15:52:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864328507] [2024-01-27 15:52:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864328507] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:52:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755988707] [2024-01-27 15:52:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:42,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:52:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:52:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:52:42,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:42,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:42,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:42,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:42,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:42,595 INFO L124 PetriNetUnfolderBase]: 3627/4919 cut-off events. [2024-01-27 15:52:42,595 INFO L125 PetriNetUnfolderBase]: For 10236/10467 co-relation queries the response was YES. [2024-01-27 15:52:42,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18722 conditions, 4919 events. 3627/4919 cut-off events. For 10236/10467 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 22599 event pairs, 1133 based on Foata normal form. 178/5063 useless extension candidates. Maximal degree in co-relation 16804. Up to 3785 conditions per place. [2024-01-27 15:52:42,628 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 7 changer transitions 1/86 dead transitions. [2024-01-27 15:52:42,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 594 flow [2024-01-27 15:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-27 15:52:42,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-01-27 15:52:42,630 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 298 flow. Second operand 5 states and 117 transitions. [2024-01-27 15:52:42,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 594 flow [2024-01-27 15:52:42,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 580 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-27 15:52:42,637 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 318 flow [2024-01-27 15:52:42,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-01-27 15:52:42,638 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-01-27 15:52:42,638 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 318 flow [2024-01-27 15:52:42,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:42,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:42,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:42,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:52:42,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:42,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1440806124, now seen corresponding path program 1 times [2024-01-27 15:52:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233449758] [2024-01-27 15:52:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:42,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:42,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233449758] [2024-01-27 15:52:42,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233449758] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:42,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230159799] [2024-01-27 15:52:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:42,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:42,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:42,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:52:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:42,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:52:42,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:43,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230159799] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:52:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2024-01-27 15:52:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32872192] [2024-01-27 15:52:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:52:43,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:43,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:43,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:43,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:43,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:43,626 INFO L124 PetriNetUnfolderBase]: 3573/4904 cut-off events. [2024-01-27 15:52:43,626 INFO L125 PetriNetUnfolderBase]: For 11661/12320 co-relation queries the response was YES. [2024-01-27 15:52:43,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19293 conditions, 4904 events. 3573/4904 cut-off events. For 11661/12320 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22910 event pairs, 675 based on Foata normal form. 270/5053 useless extension candidates. Maximal degree in co-relation 9150. Up to 2130 conditions per place. [2024-01-27 15:52:43,682 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 77 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2024-01-27 15:52:43,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 708 flow [2024-01-27 15:52:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-01-27 15:52:43,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2024-01-27 15:52:43,685 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 318 flow. Second operand 4 states and 109 transitions. [2024-01-27 15:52:43,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 708 flow [2024-01-27 15:52:43,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 692 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:52:43,696 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 377 flow [2024-01-27 15:52:43,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-01-27 15:52:43,697 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-01-27 15:52:43,698 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 377 flow [2024-01-27 15:52:43,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:43,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:43,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:43,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:52:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:52:43,935 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:43,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 205487522, now seen corresponding path program 1 times [2024-01-27 15:52:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:43,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752876998] [2024-01-27 15:52:43,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:52:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752876998] [2024-01-27 15:52:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752876998] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215269629] [2024-01-27 15:52:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:44,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:44,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:44,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:52:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:44,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:52:44,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:52:44,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:52:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215269629] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:44,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:52:44,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-01-27 15:52:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417247747] [2024-01-27 15:52:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:44,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:52:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:52:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:52:44,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:44,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:44,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:44,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:44,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:44,761 INFO L124 PetriNetUnfolderBase]: 4514/6366 cut-off events. [2024-01-27 15:52:44,761 INFO L125 PetriNetUnfolderBase]: For 23604/24026 co-relation queries the response was YES. [2024-01-27 15:52:44,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28099 conditions, 6366 events. 4514/6366 cut-off events. For 23604/24026 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31543 event pairs, 970 based on Foata normal form. 196/6515 useless extension candidates. Maximal degree in co-relation 11040. Up to 3298 conditions per place. [2024-01-27 15:52:44,800 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 86 selfloop transitions, 16 changer transitions 2/117 dead transitions. [2024-01-27 15:52:44,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 117 transitions, 965 flow [2024-01-27 15:52:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-01-27 15:52:44,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-01-27 15:52:44,801 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 377 flow. Second operand 4 states and 111 transitions. [2024-01-27 15:52:44,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 117 transitions, 965 flow [2024-01-27 15:52:44,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 965 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:52:44,814 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 595 flow [2024-01-27 15:52:44,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=595, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-01-27 15:52:44,815 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-01-27 15:52:44,815 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 595 flow [2024-01-27 15:52:44,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:44,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:44,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:44,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:52:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 15:52:45,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:45,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 319777076, now seen corresponding path program 2 times [2024-01-27 15:52:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269502309] [2024-01-27 15:52:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:52:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269502309] [2024-01-27 15:52:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269502309] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:52:45,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:52:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:52:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900253201] [2024-01-27 15:52:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:52:45,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:52:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:52:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:52:45,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:45,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 595 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:45,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:45,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:45,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:45,588 INFO L124 PetriNetUnfolderBase]: 5710/7759 cut-off events. [2024-01-27 15:52:45,588 INFO L125 PetriNetUnfolderBase]: For 34812/35576 co-relation queries the response was YES. [2024-01-27 15:52:45,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36480 conditions, 7759 events. 5710/7759 cut-off events. For 34812/35576 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 37621 event pairs, 399 based on Foata normal form. 53/7642 useless extension candidates. Maximal degree in co-relation 24117. Up to 4666 conditions per place. [2024-01-27 15:52:45,768 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 104 selfloop transitions, 9 changer transitions 4/133 dead transitions. [2024-01-27 15:52:45,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 133 transitions, 1284 flow [2024-01-27 15:52:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-01-27 15:52:45,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6512820512820513 [2024-01-27 15:52:45,769 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 595 flow. Second operand 5 states and 127 transitions. [2024-01-27 15:52:45,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 133 transitions, 1284 flow [2024-01-27 15:52:45,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 133 transitions, 1284 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:52:45,789 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 622 flow [2024-01-27 15:52:45,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=622, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-01-27 15:52:45,789 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-01-27 15:52:45,789 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 622 flow [2024-01-27 15:52:45,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:45,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:45,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:45,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:52:45,790 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:45,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1438140900, now seen corresponding path program 1 times [2024-01-27 15:52:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217824200] [2024-01-27 15:52:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:52:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217824200] [2024-01-27 15:52:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217824200] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438136630] [2024-01-27 15:52:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:45,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:45,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:45,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:45,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:52:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:45,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:52:45,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:46,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438136630] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:52:46,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:52:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-01-27 15:52:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187545313] [2024-01-27 15:52:46,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:52:46,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:52:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:52:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:52:46,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:52:46,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:46,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:46,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:52:46,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:47,094 INFO L124 PetriNetUnfolderBase]: 8135/12326 cut-off events. [2024-01-27 15:52:47,094 INFO L125 PetriNetUnfolderBase]: For 85712/89522 co-relation queries the response was YES. [2024-01-27 15:52:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61382 conditions, 12326 events. 8135/12326 cut-off events. For 85712/89522 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 78430 event pairs, 1763 based on Foata normal form. 1150/13203 useless extension candidates. Maximal degree in co-relation 20842. Up to 5546 conditions per place. [2024-01-27 15:52:47,185 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 98 selfloop transitions, 19 changer transitions 3/146 dead transitions. [2024-01-27 15:52:47,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 146 transitions, 1496 flow [2024-01-27 15:52:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:52:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:52:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-01-27 15:52:47,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7884615384615384 [2024-01-27 15:52:47,187 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 622 flow. Second operand 4 states and 123 transitions. [2024-01-27 15:52:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 146 transitions, 1496 flow [2024-01-27 15:52:47,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 146 transitions, 1464 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-27 15:52:47,224 INFO L231 Difference]: Finished difference. Result has 77 places, 87 transitions, 850 flow [2024-01-27 15:52:47,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=850, PETRI_PLACES=77, PETRI_TRANSITIONS=87} [2024-01-27 15:52:47,224 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-01-27 15:52:47,224 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 87 transitions, 850 flow [2024-01-27 15:52:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:47,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:47,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:47,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 15:52:47,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:47,437 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:47,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -393808490, now seen corresponding path program 2 times [2024-01-27 15:52:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742921034] [2024-01-27 15:52:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742921034] [2024-01-27 15:52:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742921034] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16615358] [2024-01-27 15:52:47,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:52:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:47,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:47,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:52:47,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:52:47,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:52:47,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:52:47,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:47,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16615358] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:52:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:52:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-01-27 15:52:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841456014] [2024-01-27 15:52:47,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:52:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:52:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:52:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:52:47,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:52:47,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 87 transitions, 850 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:47,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:47,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:52:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:49,971 INFO L124 PetriNetUnfolderBase]: 15753/23987 cut-off events. [2024-01-27 15:52:49,973 INFO L125 PetriNetUnfolderBase]: For 224773/232124 co-relation queries the response was YES. [2024-01-27 15:52:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134033 conditions, 23987 events. 15753/23987 cut-off events. For 224773/232124 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 171791 event pairs, 2787 based on Foata normal form. 1350/24780 useless extension candidates. Maximal degree in co-relation 38132. Up to 9970 conditions per place. [2024-01-27 15:52:50,220 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 128 selfloop transitions, 46 changer transitions 3/203 dead transitions. [2024-01-27 15:52:50,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 203 transitions, 2265 flow [2024-01-27 15:52:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:52:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:52:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-01-27 15:52:50,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2024-01-27 15:52:50,222 INFO L175 Difference]: Start difference. First operand has 77 places, 87 transitions, 850 flow. Second operand 5 states and 159 transitions. [2024-01-27 15:52:50,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 203 transitions, 2265 flow [2024-01-27 15:52:50,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 2243 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-01-27 15:52:50,343 INFO L231 Difference]: Finished difference. Result has 82 places, 114 transitions, 1305 flow [2024-01-27 15:52:50,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1305, PETRI_PLACES=82, PETRI_TRANSITIONS=114} [2024-01-27 15:52:50,343 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-01-27 15:52:50,344 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 114 transitions, 1305 flow [2024-01-27 15:52:50,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:50,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:50,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:52:50,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:52:50,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:50,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:52:50,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash 976298446, now seen corresponding path program 3 times [2024-01-27 15:52:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428334329] [2024-01-27 15:52:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428334329] [2024-01-27 15:52:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428334329] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116106424] [2024-01-27 15:52:50,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:52:50,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:50,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:50,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:52:50,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:52:50,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:52:50,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:52:50,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:51,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:52:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:52:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116106424] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:52:51,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:52:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-27 15:52:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130668118] [2024-01-27 15:52:51,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:52:51,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:52:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:52:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-01-27 15:52:51,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:52:51,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 114 transitions, 1305 flow. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:52:51,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:51,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:52:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:59,942 INFO L124 PetriNetUnfolderBase]: 53743/76229 cut-off events. [2024-01-27 15:52:59,956 INFO L125 PetriNetUnfolderBase]: For 723313/740449 co-relation queries the response was YES. [2024-01-27 15:53:00,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450472 conditions, 76229 events. 53743/76229 cut-off events. For 723313/740449 co-relation queries the response was YES. Maximal size of possible extension queue 3393. Compared 543614 event pairs, 5850 based on Foata normal form. 5815/81101 useless extension candidates. Maximal degree in co-relation 127858. Up to 22631 conditions per place. [2024-01-27 15:53:00,731 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 593 selfloop transitions, 115 changer transitions 0/723 dead transitions. [2024-01-27 15:53:00,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 723 transitions, 9988 flow [2024-01-27 15:53:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:53:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:53:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 416 transitions. [2024-01-27 15:53:00,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-01-27 15:53:00,734 INFO L175 Difference]: Start difference. First operand has 82 places, 114 transitions, 1305 flow. Second operand 15 states and 416 transitions. [2024-01-27 15:53:00,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 723 transitions, 9988 flow [2024-01-27 15:53:01,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 723 transitions, 9084 flow, removed 452 selfloop flow, removed 0 redundant places. [2024-01-27 15:53:01,399 INFO L231 Difference]: Finished difference. Result has 109 places, 211 transitions, 3032 flow [2024-01-27 15:53:01,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3032, PETRI_PLACES=109, PETRI_TRANSITIONS=211} [2024-01-27 15:53:01,400 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-01-27 15:53:01,400 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 211 transitions, 3032 flow [2024-01-27 15:53:01,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:53:01,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:53:01,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:53:01,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-27 15:53:01,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 15:53:01,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:53:01,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:53:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -632064776, now seen corresponding path program 4 times [2024-01-27 15:53:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:53:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129007311] [2024-01-27 15:53:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:53:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:53:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:53:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:53:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:53:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129007311] [2024-01-27 15:53:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129007311] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:53:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975910440] [2024-01-27 15:53:01,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:53:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:53:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:53:01,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:53:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:53:01,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:53:01,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:53:01,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:53:01,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:53:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:53:01,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:53:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:53:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975910440] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:53:01,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:53:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-27 15:53:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807486262] [2024-01-27 15:53:01,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:53:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:53:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:53:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:53:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-01-27 15:53:01,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:53:01,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 211 transitions, 3032 flow. Second operand has 13 states, 13 states have (on average 16.076923076923077) internal successors, (209), 13 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:53:01,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:53:01,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:53:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:53:10,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][100], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 9#L67true, 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:10,822 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-27 15:53:10,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:10,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:10,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:13,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][100], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 9#L67true, 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:13,115 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,115 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,115 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,115 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][477], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:13,137 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,137 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,137 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,137 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][477], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 717#(= ~counter~0 2), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 58#(<= ~N1~0 ~i1~0), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:13,357 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,357 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,357 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:13,357 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:14,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 717#(= ~counter~0 2), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:14,625 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,626 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,626 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,626 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][477], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 58#(<= ~N1~0 ~i1~0), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:14,787 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,787 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,787 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,787 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][477], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:14,961 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,961 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,961 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,961 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:14,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 717#(= ~counter~0 2), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:14,985 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,985 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,985 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:14,985 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-27 15:53:15,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 121#(<= (+ ~i2~0 1) ~N2~0), 9#L67true, 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:15,031 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-27 15:53:15,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:15,031 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-27 15:53:15,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:16,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,124 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, Black: 302#true, 38#thread3EXITtrue, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 713#true]) [2024-01-27 15:53:16,203 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,203 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:16,203 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:16,203 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,357 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,357 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,357 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,357 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 717#(= ~counter~0 2), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,427 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-27 15:53:16,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 716#(= ~counter~0 1), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 9#L67true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,555 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,555 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-27 15:53:16,555 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,555 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,612 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,612 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,613 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,613 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-27 15:53:16,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 716#(= ~counter~0 1), 58#(<= ~N1~0 ~i1~0), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:16,613 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,613 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-27 15:53:16,614 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:16,614 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:53:17,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][476], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 713#true]) [2024-01-27 15:53:17,683 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,684 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:17,684 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:17,684 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 9#L67true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:17,706 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,707 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:17,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:17,831 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,832 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,832 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:17,832 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 63#true, Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, 38#thread3EXITtrue, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,080 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,080 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:18,080 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,080 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 715#(= ~counter~0 0), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 716#(= ~counter~0 1), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 510#(= ~counter~0 1), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,081 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,081 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,082 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:53:18,082 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:53:18,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 717#(= ~counter~0 2), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,661 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 9#L67true, 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,716 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,717 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:18,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, 38#thread3EXITtrue, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,735 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,735 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,735 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,735 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:18,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:18,736 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,736 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:18,736 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:18,736 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:19,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), 715#(= ~counter~0 0), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 16#L98-4true, Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,259 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:19,259 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:19,259 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:19,259 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:19,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), 715#(= ~counter~0 0), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 509#(= ~counter~0 0), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, 16#L98-4true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,261 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:53:19,261 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:19,261 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:53:19,261 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:53:19,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][234], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 19#L64true, 58#(<= ~N1~0 ~i1~0), 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,483 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, 38#thread3EXITtrue, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,515 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,515 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,515 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,515 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:19,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 717#(= ~counter~0 2), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 715#(= ~counter~0 0), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, 1174#true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,516 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,516 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,516 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:19,516 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][556], [20#L99-1true, Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), 715#(= ~counter~0 0), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 19#L64true, 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 118#true, 434#(< ~j2~0 ~M2~0), 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 1174#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,552 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,552 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:19,552 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,552 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:19,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L44-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (<= v_~N1~0_62 v_~i1~0_64) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][551], [20#L99-1true, 715#(= ~counter~0 0), Black: 65#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)), Black: 66#(<= (+ ~j1~0 1) ~M1~0), Black: 509#(= ~counter~0 0), Black: 68#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 63#true, Black: 510#(= ~counter~0 1), Black: 1144#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1146#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 1108#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 1154#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1160#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 1148#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 74#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 1112#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1092#(< (+ ~i2~0 1) ~N2~0), Black: 925#(<= (+ ~i2~0 1) ~N2~0), Black: 920#true, Black: 1156#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1152#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 83#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 86#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 58#(<= ~N1~0 ~i1~0), 121#(<= (+ ~i2~0 1) ~N2~0), 8#L52true, Black: 98#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 268#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 434#(< ~j2~0 ~M2~0), Black: 118#true, 1158#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 302#true, 38#thread3EXITtrue, Black: 468#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 114#(and (= ~i1~0 0) (<= 1 ~N1~0)), Black: 53#(= ~counter~0 0), 507#true, 35#L75true, Black: 503#(and (<= 1 ~M2~0) (= ~j2~0 0)), 1179#(<= ~M1~0 ~j1~0), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-27 15:53:19,554 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,554 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:19,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:53:19,554 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:53:20,442 INFO L124 PetriNetUnfolderBase]: 93296/133877 cut-off events. [2024-01-27 15:53:20,442 INFO L125 PetriNetUnfolderBase]: For 1883270/1897045 co-relation queries the response was YES. [2024-01-27 15:53:21,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860190 conditions, 133877 events. 93296/133877 cut-off events. For 1883270/1897045 co-relation queries the response was YES. Maximal size of possible extension queue 6351. Compared 1047207 event pairs, 15040 based on Foata normal form. 6768/139547 useless extension candidates. Maximal degree in co-relation 765188. Up to 42869 conditions per place. [2024-01-27 15:53:22,259 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 615 selfloop transitions, 234 changer transitions 33/900 dead transitions. [2024-01-27 15:53:22,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 900 transitions, 14566 flow [2024-01-27 15:53:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:53:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:53:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 396 transitions. [2024-01-27 15:53:22,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2024-01-27 15:53:22,262 INFO L175 Difference]: Start difference. First operand has 109 places, 211 transitions, 3032 flow. Second operand 16 states and 396 transitions. [2024-01-27 15:53:22,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 900 transitions, 14566 flow [2024-01-27 15:53:31,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 900 transitions, 13800 flow, removed 383 selfloop flow, removed 0 redundant places. [2024-01-27 15:53:31,853 INFO L231 Difference]: Finished difference. Result has 133 places, 418 transitions, 6679 flow [2024-01-27 15:53:31,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2850, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6679, PETRI_PLACES=133, PETRI_TRANSITIONS=418} [2024-01-27 15:53:31,858 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-01-27 15:53:31,858 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 418 transitions, 6679 flow [2024-01-27 15:53:31,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.076923076923077) internal successors, (209), 13 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:53:31,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:53:31,859 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:53:31,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-27 15:53:32,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-27 15:53:32,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:53:32,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:53:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 752581924, now seen corresponding path program 5 times [2024-01-27 15:53:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:53:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624447497] [2024-01-27 15:53:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:53:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:53:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:53:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:53:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:53:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624447497] [2024-01-27 15:53:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624447497] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:53:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106677901] [2024-01-27 15:53:32,166 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:53:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:53:32,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:53:32,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:53:32,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:53:32,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-01-27 15:53:32,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:53:32,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:53:32,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:53:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:53:32,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:53:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:53:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106677901] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:53:32,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:53:32,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-01-27 15:53:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783122327] [2024-01-27 15:53:32,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:53:32,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:53:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:53:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:53:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:53:32,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:53:32,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 418 transitions, 6679 flow. Second operand has 14 states, 14 states have (on average 15.857142857142858) internal successors, (222), 14 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:53:32,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:53:32,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:53:32,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand