./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:44:48,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:44:48,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:44:48,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:44:49,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:44:49,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:44:49,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:44:49,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:44:49,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:44:49,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:44:49,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:44:49,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:44:49,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:44:49,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:44:49,026 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:44:49,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:44:49,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:49,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:49,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:44:49,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:44:49,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2025-01-09 16:44:49,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:44:49,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:44:49,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:44:49,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:44:49,270 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:44:49,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-01-09 16:44:50,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed905c5b4/27b39013cef64dfe90da54e442d923b2/FLAG2ee7531f7 [2025-01-09 16:44:50,655 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:44:50,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-01-09 16:44:50,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed905c5b4/27b39013cef64dfe90da54e442d923b2/FLAG2ee7531f7 [2025-01-09 16:44:51,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed905c5b4/27b39013cef64dfe90da54e442d923b2 [2025-01-09 16:44:51,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:44:51,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:44:51,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:51,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:44:51,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:44:51,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51, skipping insertion in model container [2025-01-09 16:44:51,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:44:51,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2025-01-09 16:44:51,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:51,212 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:44:51,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2025-01-09 16:44:51,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:51,257 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:44:51,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51 WrapperNode [2025-01-09 16:44:51,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:51,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:51,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:44:51,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:44:51,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,287 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 278 [2025-01-09 16:44:51,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:51,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:44:51,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:44:51,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:44:51,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,308 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 16:44:51,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:44:51,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:44:51,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:44:51,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:44:51,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (1/1) ... [2025-01-09 16:44:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:51,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:44:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:44:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:44:51,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:44:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:44:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:44:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:44:51,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:44:51,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:44:51,381 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:44:51,484 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:44:51,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:44:51,782 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:44:51,782 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:44:52,008 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:44:52,009 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:44:52,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:52 BoogieIcfgContainer [2025-01-09 16:44:52,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:44:52,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:44:52,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:44:52,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:44:52,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:51" (1/3) ... [2025-01-09 16:44:52,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3457d956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:52, skipping insertion in model container [2025-01-09 16:44:52,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:51" (2/3) ... [2025-01-09 16:44:52,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3457d956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:52, skipping insertion in model container [2025-01-09 16:44:52,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:52" (3/3) ... [2025-01-09 16:44:52,015 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-01-09 16:44:52,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:44:52,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:44:52,027 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:44:52,083 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:44:52,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-01-09 16:44:52,135 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-01-09 16:44:52,137 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:44:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-01-09 16:44:52,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-01-09 16:44:52,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-01-09 16:44:52,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:44:52,152 INFO L333 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, 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;@1b0f60d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:44:52,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:44:52,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:44:52,163 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-01-09 16:44:52,163 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:44:52,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:52,164 INFO L206 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] [2025-01-09 16:44:52,164 INFO L396 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)] === [2025-01-09 16:44:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash -219375534, now seen corresponding path program 1 times [2025-01-09 16:44:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894278022] [2025-01-09 16:44:52,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:52,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:44:52,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:44:52,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:52,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894278022] [2025-01-09 16:44:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894278022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:52,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:44:52,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823646507] [2025-01-09 16:44:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:52,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:44:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:52,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:44:52,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:44:52,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:44:52,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2025-01-09 16:44:52,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:52,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:44:52,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:53,003 INFO L124 PetriNetUnfolderBase]: 2407/3722 cut-off events. [2025-01-09 16:44:53,004 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-01-09 16:44:53,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 3722 events. 2407/3722 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21427 event pairs, 472 based on Foata normal form. 1/3532 useless extension candidates. Maximal degree in co-relation 6303. Up to 2067 conditions per place. [2025-01-09 16:44:53,031 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 41 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2025-01-09 16:44:53,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 253 flow [2025-01-09 16:44:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:44:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:44:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-09 16:44:53,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7266666666666667 [2025-01-09 16:44:53,041 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 3 states and 109 transitions. [2025-01-09 16:44:53,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 253 flow [2025-01-09 16:44:53,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 227 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:44:53,051 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 117 flow [2025-01-09 16:44:53,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-01-09 16:44:53,055 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-01-09 16:44:53,055 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 117 flow [2025-01-09 16:44:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2025-01-09 16:44:53,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:53,055 INFO L206 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] [2025-01-09 16:44:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:44:53,056 INFO L396 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)] === [2025-01-09 16:44:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1690262137, now seen corresponding path program 1 times [2025-01-09 16:44:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800624447] [2025-01-09 16:44:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:44:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:44:53,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800624447] [2025-01-09 16:44:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800624447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:44:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628975189] [2025-01-09 16:44:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:44:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:44:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:44:53,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:44:53,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:44:53,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:53,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:44:53,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:53,598 INFO L124 PetriNetUnfolderBase]: 2397/3638 cut-off events. [2025-01-09 16:44:53,599 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2025-01-09 16:44:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7569 conditions, 3638 events. 2397/3638 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20759 event pairs, 549 based on Foata normal form. 84/3565 useless extension candidates. Maximal degree in co-relation 2645. Up to 2321 conditions per place. [2025-01-09 16:44:53,617 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-09 16:44:53,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 275 flow [2025-01-09 16:44:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:44:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:44:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-09 16:44:53,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-01-09 16:44:53,619 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 117 flow. Second operand 3 states and 112 transitions. [2025-01-09 16:44:53,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 275 flow [2025-01-09 16:44:53,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:53,621 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 128 flow [2025-01-09 16:44:53,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-01-09 16:44:53,621 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-01-09 16:44:53,621 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 128 flow [2025-01-09 16:44:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:44:53,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:53,622 INFO L206 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] [2025-01-09 16:44:53,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:44:53,622 INFO L396 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)] === [2025-01-09 16:44:53,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2063322799, now seen corresponding path program 1 times [2025-01-09 16:44:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:53,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-01-09 16:44:53,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:53,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:44:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:44:53,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:53,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-01-09 16:44:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930794511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:44:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190983680] [2025-01-09 16:44:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:53,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:44:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:53,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:44:53,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:44:53,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:44:53,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:44:53,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:53,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:44:53,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:54,042 INFO L124 PetriNetUnfolderBase]: 2362/3753 cut-off events. [2025-01-09 16:44:54,043 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2025-01-09 16:44:54,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8159 conditions, 3753 events. 2362/3753 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22765 event pairs, 571 based on Foata normal form. 35/3626 useless extension candidates. Maximal degree in co-relation 5968. Up to 2334 conditions per place. [2025-01-09 16:44:54,057 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-09 16:44:54,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 291 flow [2025-01-09 16:44:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:44:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:44:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-01-09 16:44:54,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-09 16:44:54,058 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 128 flow. Second operand 3 states and 110 transitions. [2025-01-09 16:44:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 291 flow [2025-01-09 16:44:54,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:54,060 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 140 flow [2025-01-09 16:44:54,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-01-09 16:44:54,061 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-01-09 16:44:54,061 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 140 flow [2025-01-09 16:44:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:44:54,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:54,061 INFO L206 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, 1, 1] [2025-01-09 16:44:54,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:44:54,061 INFO L396 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)] === [2025-01-09 16:44:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash 240148690, now seen corresponding path program 1 times [2025-01-09 16:44:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821648833] [2025-01-09 16:44:54,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:54,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:44:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:44:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821648833] [2025-01-09 16:44:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821648833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:54,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:54,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:44:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292843313] [2025-01-09 16:44:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:54,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:44:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:54,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:44:54,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:44:54,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:44:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) [2025-01-09 16:44:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:54,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:44:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:54,500 INFO L124 PetriNetUnfolderBase]: 2793/4440 cut-off events. [2025-01-09 16:44:54,500 INFO L125 PetriNetUnfolderBase]: For 2274/2274 co-relation queries the response was YES. [2025-01-09 16:44:54,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10243 conditions, 4440 events. 2793/4440 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29268 event pairs, 2080 based on Foata normal form. 93/4057 useless extension candidates. Maximal degree in co-relation 4760. Up to 3077 conditions per place. [2025-01-09 16:44:54,522 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-01-09 16:44:54,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 331 flow [2025-01-09 16:44:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:44:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:44:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-01-09 16:44:54,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685 [2025-01-09 16:44:54,523 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 140 flow. Second operand 4 states and 137 transitions. [2025-01-09 16:44:54,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 331 flow [2025-01-09 16:44:54,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:54,525 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 158 flow [2025-01-09 16:44:54,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-01-09 16:44:54,528 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-01-09 16:44:54,528 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 158 flow [2025-01-09 16:44:54,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) [2025-01-09 16:44:54,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:54,528 INFO L206 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, 1, 1] [2025-01-09 16:44:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:44:54,529 INFO L396 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)] === [2025-01-09 16:44:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 355269892, now seen corresponding path program 1 times [2025-01-09 16:44:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-01-09 16:44:54,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:54,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:44:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:44:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-01-09 16:44:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434202644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:44:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328303696] [2025-01-09 16:44:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:44:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:44:54,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:44:54,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:44:54,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) [2025-01-09 16:44:54,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:54,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:44:54,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:55,185 INFO L124 PetriNetUnfolderBase]: 3453/5659 cut-off events. [2025-01-09 16:44:55,186 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2025-01-09 16:44:55,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12770 conditions, 5659 events. 3453/5659 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 40517 event pairs, 2644 based on Foata normal form. 132/5190 useless extension candidates. Maximal degree in co-relation 10432. Up to 3841 conditions per place. [2025-01-09 16:44:55,218 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 54 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-01-09 16:44:55,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 346 flow [2025-01-09 16:44:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:44:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:44:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-01-09 16:44:55,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-01-09 16:44:55,221 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 158 flow. Second operand 4 states and 135 transitions. [2025-01-09 16:44:55,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 346 flow [2025-01-09 16:44:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 342 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:55,226 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 177 flow [2025-01-09 16:44:55,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-01-09 16:44:55,226 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-01-09 16:44:55,227 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 177 flow [2025-01-09 16:44:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) [2025-01-09 16:44:55,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:55,227 INFO L206 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, 1, 1, 1] [2025-01-09 16:44:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:44:55,228 INFO L396 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)] === [2025-01-09 16:44:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1966857098, now seen corresponding path program 1 times [2025-01-09 16:44:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852422772] [2025-01-09 16:44:55,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:44:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:44:55,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:55,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:55,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852422772] [2025-01-09 16:44:55,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852422772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:55,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:44:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-01-09 16:44:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:55,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:44:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:55,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:44:55,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:44:55,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:44:55,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:44:55,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:55,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:44:55,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:56,576 INFO L124 PetriNetUnfolderBase]: 10067/14656 cut-off events. [2025-01-09 16:44:56,576 INFO L125 PetriNetUnfolderBase]: For 6532/6532 co-relation queries the response was YES. [2025-01-09 16:44:56,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34308 conditions, 14656 events. 10067/14656 cut-off events. For 6532/6532 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 96180 event pairs, 627 based on Foata normal form. 108/13909 useless extension candidates. Maximal degree in co-relation 27298. Up to 10001 conditions per place. [2025-01-09 16:44:56,638 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 99 selfloop transitions, 10 changer transitions 3/124 dead transitions. [2025-01-09 16:44:56,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 630 flow [2025-01-09 16:44:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:44:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:44:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-01-09 16:44:56,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-09 16:44:56,640 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 177 flow. Second operand 6 states and 195 transitions. [2025-01-09 16:44:56,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 630 flow [2025-01-09 16:44:56,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 625 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:56,645 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 235 flow [2025-01-09 16:44:56,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-01-09 16:44:56,647 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2025-01-09 16:44:56,648 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 235 flow [2025-01-09 16:44:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:44:56,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:56,648 INFO L206 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, 1, 1, 1] [2025-01-09 16:44:56,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:44:56,649 INFO L396 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)] === [2025-01-09 16:44:56,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1828431282, now seen corresponding path program 2 times [2025-01-09 16:44:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-01-09 16:44:56,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:44:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:56,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:44:56,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-01-09 16:44:56,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:44:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-01-09 16:44:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883090942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:44:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694015144] [2025-01-09 16:44:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:56,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:44:57,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:44:57,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 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) [2025-01-09 16:44:57,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:57,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:44:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:58,068 INFO L124 PetriNetUnfolderBase]: 10207/15540 cut-off events. [2025-01-09 16:44:58,068 INFO L125 PetriNetUnfolderBase]: For 9955/9965 co-relation queries the response was YES. [2025-01-09 16:44:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40497 conditions, 15540 events. 10207/15540 cut-off events. For 9955/9965 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 108933 event pairs, 1475 based on Foata normal form. 56/15421 useless extension candidates. Maximal degree in co-relation 31725. Up to 10001 conditions per place. [2025-01-09 16:44:58,152 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 84 selfloop transitions, 12 changer transitions 18/126 dead transitions. [2025-01-09 16:44:58,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 684 flow [2025-01-09 16:44:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:44:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:44:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-01-09 16:44:58,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-01-09 16:44:58,153 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 235 flow. Second operand 6 states and 194 transitions. [2025-01-09 16:44:58,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 684 flow [2025-01-09 16:44:58,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:44:58,159 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 300 flow [2025-01-09 16:44:58,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-01-09 16:44:58,160 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-01-09 16:44:58,160 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 300 flow [2025-01-09 16:44:58,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 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) [2025-01-09 16:44:58,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:58,160 INFO L206 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, 1, 1, 1] [2025-01-09 16:44:58,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:44:58,161 INFO L396 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)] === [2025-01-09 16:44:58,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2122438384, now seen corresponding path program 3 times [2025-01-09 16:44:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-01-09 16:44:58,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:44:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:58,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:44:58,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-01-09 16:44:58,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:44:58,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:58,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-01-09 16:44:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752789115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:44:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298769563] [2025-01-09 16:44:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:58,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:44:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:58,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:44:58,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:44:58,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:44:58,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:44:58,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:58,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:44:58,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:59,785 INFO L124 PetriNetUnfolderBase]: 12154/18222 cut-off events. [2025-01-09 16:44:59,786 INFO L125 PetriNetUnfolderBase]: For 18606/19070 co-relation queries the response was YES. [2025-01-09 16:44:59,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52199 conditions, 18222 events. 12154/18222 cut-off events. For 18606/19070 co-relation queries the response was YES. Maximal size of possible extension queue 1078. Compared 129771 event pairs, 1229 based on Foata normal form. 883/18876 useless extension candidates. Maximal degree in co-relation 41938. Up to 11217 conditions per place. [2025-01-09 16:45:00,024 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 109 selfloop transitions, 20 changer transitions 9/152 dead transitions. [2025-01-09 16:45:00,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 152 transitions, 922 flow [2025-01-09 16:45:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:45:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:45:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-01-09 16:45:00,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2025-01-09 16:45:00,026 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 300 flow. Second operand 7 states and 228 transitions. [2025-01-09 16:45:00,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 152 transitions, 922 flow [2025-01-09 16:45:00,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 152 transitions, 901 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:00,105 INFO L231 Difference]: Finished difference. Result has 82 places, 75 transitions, 405 flow [2025-01-09 16:45:00,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=405, PETRI_PLACES=82, PETRI_TRANSITIONS=75} [2025-01-09 16:45:00,106 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2025-01-09 16:45:00,106 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 75 transitions, 405 flow [2025-01-09 16:45:00,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:45:00,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:00,106 INFO L206 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, 1, 1, 1] [2025-01-09 16:45:00,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:45:00,106 INFO L396 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)] === [2025-01-09 16:45:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 908609754, now seen corresponding path program 4 times [2025-01-09 16:45:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673609846] [2025-01-09 16:45:00,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:00,119 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:45:00,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:00,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:45:00,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673609846] [2025-01-09 16:45:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673609846] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373815511] [2025-01-09 16:45:00,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:00,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:45:00,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:45:00,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:45:00,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:00,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:45:00,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:00,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:45:00,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:00,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:45:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373815511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:45:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 7 [2025-01-09 16:45:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077041539] [2025-01-09 16:45:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:00,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:00,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:45:00,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:45:00,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 75 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2025-01-09 16:45:00,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:00,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:45:00,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:02,465 INFO L124 PetriNetUnfolderBase]: 19022/28232 cut-off events. [2025-01-09 16:45:02,465 INFO L125 PetriNetUnfolderBase]: For 40128/41364 co-relation queries the response was YES. [2025-01-09 16:45:02,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87995 conditions, 28232 events. 19022/28232 cut-off events. For 40128/41364 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 202043 event pairs, 2255 based on Foata normal form. 1604/29179 useless extension candidates. Maximal degree in co-relation 72476. Up to 9567 conditions per place. [2025-01-09 16:45:02,665 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 140 selfloop transitions, 33 changer transitions 1/191 dead transitions. [2025-01-09 16:45:02,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 191 transitions, 1378 flow [2025-01-09 16:45:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:45:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:45:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2025-01-09 16:45:02,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-01-09 16:45:02,666 INFO L175 Difference]: Start difference. First operand has 82 places, 75 transitions, 405 flow. Second operand 7 states and 218 transitions. [2025-01-09 16:45:02,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 191 transitions, 1378 flow [2025-01-09 16:45:02,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 191 transitions, 1338 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:45:02,704 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 637 flow [2025-01-09 16:45:02,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2025-01-09 16:45:02,704 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2025-01-09 16:45:02,705 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 637 flow [2025-01-09 16:45:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) [2025-01-09 16:45:02,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:02,705 INFO L206 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, 1, 1, 1] [2025-01-09 16:45:02,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:45:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:02,909 INFO L396 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)] === [2025-01-09 16:45:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -673590924, now seen corresponding path program 5 times [2025-01-09 16:45:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-01-09 16:45:02,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:45:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:02,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:45:02,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:02,929 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-01-09 16:45:03,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:03,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:03,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:45:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843189754] [2025-01-09 16:45:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:03,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:45:03,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:03,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:45:03,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:45:03,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:45:03,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 637 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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) [2025-01-09 16:45:03,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:03,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:45:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:07,669 INFO L124 PetriNetUnfolderBase]: 35668/52794 cut-off events. [2025-01-09 16:45:07,669 INFO L125 PetriNetUnfolderBase]: For 130080/132424 co-relation queries the response was YES. [2025-01-09 16:45:07,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197498 conditions, 52794 events. 35668/52794 cut-off events. For 130080/132424 co-relation queries the response was YES. Maximal size of possible extension queue 2404. Compared 399580 event pairs, 3354 based on Foata normal form. 2928/54588 useless extension candidates. Maximal degree in co-relation 174302. Up to 25499 conditions per place. [2025-01-09 16:45:08,060 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 254 selfloop transitions, 136 changer transitions 18/424 dead transitions. [2025-01-09 16:45:08,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 424 transitions, 3894 flow [2025-01-09 16:45:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:45:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:45:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 435 transitions. [2025-01-09 16:45:08,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-01-09 16:45:08,062 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 637 flow. Second operand 14 states and 435 transitions. [2025-01-09 16:45:08,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 424 transitions, 3894 flow [2025-01-09 16:45:08,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 424 transitions, 3802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:08,334 INFO L231 Difference]: Finished difference. Result has 112 places, 229 transitions, 2510 flow [2025-01-09 16:45:08,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2510, PETRI_PLACES=112, PETRI_TRANSITIONS=229} [2025-01-09 16:45:08,334 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2025-01-09 16:45:08,334 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 229 transitions, 2510 flow [2025-01-09 16:45:08,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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) [2025-01-09 16:45:08,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:08,335 INFO L206 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, 1, 1, 1] [2025-01-09 16:45:08,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:45:08,335 INFO L396 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)] === [2025-01-09 16:45:08,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1673883092, now seen corresponding path program 6 times [2025-01-09 16:45:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-01-09 16:45:08,336 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:45:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:08,343 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:45:08,349 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-01-09 16:45:08,349 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:45:08,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-01-09 16:45:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016702138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:08,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550827965] [2025-01-09 16:45:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:08,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:08,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:08,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:45:08,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 229 transitions, 2510 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:45:08,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:08,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:45:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:13,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:13,827 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:45:13,827 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:13,827 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:13,827 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:14,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:14,120 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,120 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,120 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,120 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 261#true, Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 43#L83true, 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:14,121 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,121 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:14,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 43#L83true, 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:14,699 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,699 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,699 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,699 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:14,700 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,700 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,700 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,700 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:14,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][288], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), 12#L56true, Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:14,911 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-09 16:45:14,911 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:14,911 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:14,911 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:15,462 INFO L124 PetriNetUnfolderBase]: 42139/62706 cut-off events. [2025-01-09 16:45:15,462 INFO L125 PetriNetUnfolderBase]: For 333022/337777 co-relation queries the response was YES. [2025-01-09 16:45:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281620 conditions, 62706 events. 42139/62706 cut-off events. For 333022/337777 co-relation queries the response was YES. Maximal size of possible extension queue 2970. Compared 490340 event pairs, 5089 based on Foata normal form. 1638/61847 useless extension candidates. Maximal degree in co-relation 239277. Up to 40365 conditions per place. [2025-01-09 16:45:16,138 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 174 selfloop transitions, 187 changer transitions 15/417 dead transitions. [2025-01-09 16:45:16,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 417 transitions, 4832 flow [2025-01-09 16:45:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:45:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:45:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 296 transitions. [2025-01-09 16:45:16,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2025-01-09 16:45:16,140 INFO L175 Difference]: Start difference. First operand has 112 places, 229 transitions, 2510 flow. Second operand 9 states and 296 transitions. [2025-01-09 16:45:16,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 417 transitions, 4832 flow [2025-01-09 16:45:17,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 417 transitions, 4824 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 16:45:17,652 INFO L231 Difference]: Finished difference. Result has 125 places, 293 transitions, 3898 flow [2025-01-09 16:45:17,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3898, PETRI_PLACES=125, PETRI_TRANSITIONS=293} [2025-01-09 16:45:17,653 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 73 predicate places. [2025-01-09 16:45:17,653 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 293 transitions, 3898 flow [2025-01-09 16:45:17,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:45:17,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:17,654 INFO L206 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, 1, 1, 1] [2025-01-09 16:45:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:45:17,654 INFO L396 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)] === [2025-01-09 16:45:17,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1505141748, now seen corresponding path program 7 times [2025-01-09 16:45:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-01-09 16:45:17,655 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:45:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:17,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:45:17,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-01-09 16:45:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306410323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:45:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196898] [2025-01-09 16:45:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:17,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:45:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:45:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:45:17,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-01-09 16:45:17,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 293 transitions, 3898 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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) [2025-01-09 16:45:17,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:17,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-01-09 16:45:17,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:24,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][438], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 322#(and (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:24,140 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 43#L83true, 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:24,469 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,469 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,469 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,469 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][438], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 322#(and (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 261#true, Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:24,717 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:24,765 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][438], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 322#(and (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:24,765 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,765 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,765 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,765 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:24,765 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:45:25,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 43#L83true, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:25,087 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,087 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,087 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,087 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), 316#true, Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:25,095 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,095 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,095 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,095 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 28#L73true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:25,097 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,098 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,098 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,098 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,259 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][438], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 322#(and (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 46#L80true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:25,260 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,260 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,260 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,260 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,260 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,266 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 43#L83true, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:25,266 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,266 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,266 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,266 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,266 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:45:25,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), 316#true, Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:25,502 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,502 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,502 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,502 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), 316#true, Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 38#L98true, 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 12#L56true, 28#L73true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:25,504 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,504 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,504 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,504 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:25,846 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 43#L83true, 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:25,847 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,847 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,848 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,848 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,848 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,850 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), 316#true, Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:25,850 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,850 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,850 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,850 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,850 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,852 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 21#L145-4true, Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 28#L73true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 62#(= ~total~0 0)]) [2025-01-09 16:45:25,852 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,852 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,852 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,852 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:25,852 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:45:26,032 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 47#thread2EXITtrue, 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:26,033 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,033 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,033 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,033 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,033 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,035 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] L94-->L98: Formula: (let ((.cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse0 (select (select |v_#memory_int#1_89| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (and (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_102 .cse0)) (not (= (ite (or .cse2 (<= .cse0 0)) 1 0) 0)) (= v_~total~0_101 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (and (< v_~q1_front~0_99 v_~n1~0_82) (< v_~q1_front~0_99 v_~q1_back~0_94) (<= 0 v_~q1_front~0_99)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_82, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_89|, ~total~0=v_~total~0_102} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_82, #memory_int#1=|v_#memory_int#1_89|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_101, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_94, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][333], [Black: 124#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 249#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 126#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 66#(<= ~q1_back~0 ~q1_front~0), Black: 246#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 252#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 70#(<= ~q2_back~0 ~q2_front~0), 84#true, Black: 75#(<= ~n1~0 0), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 265#(or (and (<= 0 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0))), Black: 278#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 268#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 282#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 276#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 261#true, Black: 86#(and (= ~j~0 0) (= ~i~0 0)), Black: 274#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 91#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 280#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 93#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 263#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 95#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 272#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 267#(and (= ~j~0 0) (<= 1 ~N~0)), Black: 270#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), 316#true, 6#thread4EXITtrue, 254#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 295#true, 38#L98true, Black: 102#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), 17#L146true, Black: 103#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 108#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 310#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), 12#L56true, Black: 308#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 28#L73true, Black: 302#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 300#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 306#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (< |thread1Thread1of1ForFork1_~cond~0#1| 1) (< 0 ~N~0))), Black: 62#(= ~total~0 0), Black: 120#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (= ~j~0 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2025-01-09 16:45:26,035 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:45:26,274 INFO L124 PetriNetUnfolderBase]: 54542/79591 cut-off events. [2025-01-09 16:45:26,274 INFO L125 PetriNetUnfolderBase]: For 493152/500281 co-relation queries the response was YES. [2025-01-09 16:45:26,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379954 conditions, 79591 events. 54542/79591 cut-off events. For 493152/500281 co-relation queries the response was YES. Maximal size of possible extension queue 3715. Compared 615992 event pairs, 7856 based on Foata normal form. 1958/78336 useless extension candidates. Maximal degree in co-relation 327860. Up to 52121 conditions per place. [2025-01-09 16:45:27,423 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 190 selfloop transitions, 239 changer transitions 8/477 dead transitions. [2025-01-09 16:45:27,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 477 transitions, 6596 flow [2025-01-09 16:45:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:45:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:45:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 286 transitions. [2025-01-09 16:45:27,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2025-01-09 16:45:27,425 INFO L175 Difference]: Start difference. First operand has 125 places, 293 transitions, 3898 flow. Second operand 9 states and 286 transitions. [2025-01-09 16:45:27,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 477 transitions, 6596 flow [2025-01-09 16:45:30,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 477 transitions, 6368 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:30,831 INFO L231 Difference]: Finished difference. Result has 136 places, 350 transitions, 5269 flow [2025-01-09 16:45:30,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3718, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5269, PETRI_PLACES=136, PETRI_TRANSITIONS=350} [2025-01-09 16:45:30,832 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 84 predicate places. [2025-01-09 16:45:30,832 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 350 transitions, 5269 flow [2025-01-09 16:45:30,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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) [2025-01-09 16:45:30,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:30,832 INFO L206 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, 1, 1, 1] [2025-01-09 16:45:30,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:45:30,832 INFO L396 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)] === [2025-01-09 16:45:30,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:30,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1060916262, now seen corresponding path program 8 times [2025-01-09 16:45:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:30,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-01-09 16:45:30,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:30,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:45:30,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-01-09 16:45:30,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:45:30,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-01-09 16:45:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924510177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878537084] [2025-01-09 16:45:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:31,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:31,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:45:31,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 350 transitions, 5269 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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) [2025-01-09 16:45:31,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:31,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:45:31,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand