./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:28:40,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:28:40,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:28:40,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:28:40,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:28:40,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:28:40,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:28:40,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:28:40,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:28:40,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:28:40,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:28:40,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:28:40,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:28:40,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:28:40,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:28:40,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:40,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:28:40,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:28:40,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:28:40,178 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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-03-09 01:28:40,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:28:40,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:28:40,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:28:40,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:28:40,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:28:40,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-09 01:28:41,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4ee690b/ba04d8bbb2b04c43a560eee433c9a810/FLAGbd91a9526 [2025-03-09 01:28:41,743 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:28:41,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-09 01:28:41,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4ee690b/ba04d8bbb2b04c43a560eee433c9a810/FLAGbd91a9526 [2025-03-09 01:28:41,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4ee690b/ba04d8bbb2b04c43a560eee433c9a810 [2025-03-09 01:28:41,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:28:41,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:28:41,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:41,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:28:41,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:28:41,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab6b66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41, skipping insertion in model container [2025-03-09 01:28:41,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:28:41,890 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:28:41,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:41,900 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:28:41,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:41,927 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:28:41,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41 WrapperNode [2025-03-09 01:28:41,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:41,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:41,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:28:41,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:28:41,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,960 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 226 [2025-03-09 01:28:41,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:41,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:28:41,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:28:41,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:28:41,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,981 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-03-09 01:28:41,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:41,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:28:41,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:28:41,998 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:28:41,998 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:28:41,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (1/1) ... [2025-03-09 01:28:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:42,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:28:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:28:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:28:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:28:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:28:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:28:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:28:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:28:42,045 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:28:42,112 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:28:42,113 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:28:42,419 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:28:42,419 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:28:42,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:28:42,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:28:42,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:42 BoogieIcfgContainer [2025-03-09 01:28:42,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:28:42,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:28:42,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:28:42,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:28:42,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:28:41" (1/3) ... [2025-03-09 01:28:42,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65baef39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:42, skipping insertion in model container [2025-03-09 01:28:42,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:41" (2/3) ... [2025-03-09 01:28:42,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65baef39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:42, skipping insertion in model container [2025-03-09 01:28:42,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:42" (3/3) ... [2025-03-09 01:28:42,662 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-03-09 01:28:42,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:28:42,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-03-09 01:28:42,673 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:28:42,724 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:28:42,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-03-09 01:28:42,777 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-03-09 01:28:42,779 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:28:42,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-09 01:28:42,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-03-09 01:28:42,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-03-09 01:28:42,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:28:42,802 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=None, 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;@15bbb082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:28:42,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-09 01:28:42,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:28:42,809 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:28:42,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:28:42,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:42,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:42,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 647922, now seen corresponding path program 1 times [2025-03-09 01:28:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305062028] [2025-03-09 01:28:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:42,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:42,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:42,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:42,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305062028] [2025-03-09 01:28:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305062028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:43,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850620239] [2025-03-09 01:28:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:43,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:43,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-03-09 01:28:43,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:43,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:43,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:43,586 INFO L124 PetriNetUnfolderBase]: 3071/4842 cut-off events. [2025-03-09 01:28:43,586 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-03-09 01:28:43,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9318 conditions, 4842 events. 3071/4842 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28683 event pairs, 2731 based on Foata normal form. 1/3084 useless extension candidates. Maximal degree in co-relation 8911. Up to 4203 conditions per place. [2025-03-09 01:28:43,628 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 38 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-09 01:28:43,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 198 flow [2025-03-09 01:28:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-09 01:28:43,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-09 01:28:43,642 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 87 transitions. [2025-03-09 01:28:43,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 198 flow [2025-03-09 01:28:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 186 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:43,657 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-03-09 01:28:43,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-09 01:28:43,663 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-03-09 01:28:43,664 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-03-09 01:28:43,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-03-09 01:28:43,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:43,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:28:43,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 647923, now seen corresponding path program 1 times [2025-03-09 01:28:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:43,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232339798] [2025-03-09 01:28:43,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:43,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:43,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:43,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:43,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232339798] [2025-03-09 01:28:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232339798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:43,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129570516] [2025-03-09 01:28:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:43,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:43,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:43,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:43,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-09 01:28:43,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:43,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:44,384 INFO L124 PetriNetUnfolderBase]: 3072/4845 cut-off events. [2025-03-09 01:28:44,384 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-09 01:28:44,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9164 conditions, 4845 events. 3072/4845 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28671 event pairs, 2731 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 9135. Up to 4212 conditions per place. [2025-03-09 01:28:44,409 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-09 01:28:44,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 206 flow [2025-03-09 01:28:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-09 01:28:44,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-09 01:28:44,411 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 102 transitions. [2025-03-09 01:28:44,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 206 flow [2025-03-09 01:28:44,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:44,413 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-03-09 01:28:44,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-09 01:28:44,414 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-03-09 01:28:44,414 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-03-09 01:28:44,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-09 01:28:44,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:44,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:28:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:28:44,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash 20087568, now seen corresponding path program 1 times [2025-03-09 01:28:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186897974] [2025-03-09 01:28:44,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:28:44,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:28:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186897974] [2025-03-09 01:28:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186897974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483740621] [2025-03-09 01:28:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:44,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:44,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:44,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:44,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-03-09 01:28:44,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:44,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:44,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:44,983 INFO L124 PetriNetUnfolderBase]: 3073/4848 cut-off events. [2025-03-09 01:28:44,984 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-09 01:28:44,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 4848 events. 3073/4848 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28666 event pairs, 2731 based on Foata normal form. 0/3086 useless extension candidates. Maximal degree in co-relation 9156. Up to 4211 conditions per place. [2025-03-09 01:28:45,013 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-09 01:28:45,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 235 flow [2025-03-09 01:28:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-09 01:28:45,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-03-09 01:28:45,016 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 119 transitions. [2025-03-09 01:28:45,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 235 flow [2025-03-09 01:28:45,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:45,018 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-03-09 01:28:45,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-09 01:28:45,019 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-09 01:28:45,020 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-03-09 01:28:45,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-03-09 01:28:45,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:45,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:28:45,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:28:45,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:45,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash 622674393, now seen corresponding path program 1 times [2025-03-09 01:28:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74302430] [2025-03-09 01:28:45,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:45,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:45,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:45,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:45,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74302430] [2025-03-09 01:28:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74302430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113789572] [2025-03-09 01:28:45,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:45,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:45,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:28:45,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:45,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:45,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:45,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:45,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:28:45,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:45,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:28:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:45,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113789572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:45,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:28:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525795281] [2025-03-09 01:28:45,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:45,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:45,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:45,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:45,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:45,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 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-03-09 01:28:45,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:45,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:45,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:45,984 INFO L124 PetriNetUnfolderBase]: 3073/4847 cut-off events. [2025-03-09 01:28:45,985 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-09 01:28:45,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 4847 events. 3073/4847 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28729 event pairs, 2731 based on Foata normal form. 0/3088 useless extension candidates. Maximal degree in co-relation 9166. Up to 4211 conditions per place. [2025-03-09 01:28:45,999 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-09 01:28:45,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 257 flow [2025-03-09 01:28:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-09 01:28:46,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-03-09 01:28:46,001 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 6 states and 129 transitions. [2025-03-09 01:28:46,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 257 flow [2025-03-09 01:28:46,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:46,002 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 176 flow [2025-03-09 01:28:46,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-03-09 01:28:46,002 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-03-09 01:28:46,002 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 176 flow [2025-03-09 01:28:46,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 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-03-09 01:28:46,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:46,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:28:46,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:46,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:46,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:46,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2124303630, now seen corresponding path program 1 times [2025-03-09 01:28:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807753858] [2025-03-09 01:28:46,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:28:46,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:28:46,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:46,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:46,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807753858] [2025-03-09 01:28:46,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807753858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:46,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341893218] [2025-03-09 01:28:46,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:46,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:46,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:46,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:28:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:28:46,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:28:46,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:46,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:46,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:28:46,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:46,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:28:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:46,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:46,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341893218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:46,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:46,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:28:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244812437] [2025-03-09 01:28:46,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:28:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:46,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:28:46,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:28:46,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:46,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 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-03-09 01:28:46,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:46,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:46,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:47,344 INFO L124 PetriNetUnfolderBase]: 3073/4846 cut-off events. [2025-03-09 01:28:47,344 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-09 01:28:47,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9198 conditions, 4846 events. 3073/4846 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28667 event pairs, 2731 based on Foata normal form. 0/3088 useless extension candidates. Maximal degree in co-relation 9165. Up to 4203 conditions per place. [2025-03-09 01:28:47,367 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 34 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-03-09 01:28:47,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 264 flow [2025-03-09 01:28:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:28:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:28:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-03-09 01:28:47,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2025-03-09 01:28:47,368 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 176 flow. Second operand 7 states and 145 transitions. [2025-03-09 01:28:47,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 264 flow [2025-03-09 01:28:47,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 230 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-09 01:28:47,372 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 162 flow [2025-03-09 01:28:47,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-09 01:28:47,373 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-09 01:28:47,373 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 162 flow [2025-03-09 01:28:47,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 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-03-09 01:28:47,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:47,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:47,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:47,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:47,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1432130176, now seen corresponding path program 1 times [2025-03-09 01:28:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048013967] [2025-03-09 01:28:47,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:47,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:28:47,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:28:47,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:47,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048013967] [2025-03-09 01:28:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048013967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:47,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:47,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550305196] [2025-03-09 01:28:47,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:47,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:47,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:47,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:47,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03-09 01:28:47,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:47,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:47,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:47,979 INFO L124 PetriNetUnfolderBase]: 3213/5106 cut-off events. [2025-03-09 01:28:47,979 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-09 01:28:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9696 conditions, 5106 events. 3213/5106 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30367 event pairs, 2858 based on Foata normal form. 101/3413 useless extension candidates. Maximal degree in co-relation 9149. Up to 4212 conditions per place. [2025-03-09 01:28:47,994 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 60 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-03-09 01:28:47,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 363 flow [2025-03-09 01:28:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-09 01:28:47,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-03-09 01:28:47,996 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 162 flow. Second operand 5 states and 152 transitions. [2025-03-09 01:28:47,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 363 flow [2025-03-09 01:28:47,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 324 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:28:47,997 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 182 flow [2025-03-09 01:28:47,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-09 01:28:47,998 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-03-09 01:28:47,998 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 182 flow [2025-03-09 01:28:47,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03-09 01:28:47,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:47,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:28:47,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:47,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -231076250, now seen corresponding path program 1 times [2025-03-09 01:28:47,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589561912] [2025-03-09 01:28:47,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:28:48,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:28:48,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589561912] [2025-03-09 01:28:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589561912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:48,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31720274] [2025-03-09 01:28:48,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:48,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:48,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:28:48,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:28:48,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:28:48,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:28:48,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:48,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:28:48,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:28:48,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 01:28:48,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:28:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:28:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:48,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31720274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-09 01:28:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258550600] [2025-03-09 01:28:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:48,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:28:48,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:48,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:48,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,532 INFO L124 PetriNetUnfolderBase]: 2360/3811 cut-off events. [2025-03-09 01:28:48,532 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2025-03-09 01:28:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7862 conditions, 3811 events. 2360/3811 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21571 event pairs, 2053 based on Foata normal form. 0/2678 useless extension candidates. Maximal degree in co-relation 7340. Up to 3239 conditions per place. [2025-03-09 01:28:48,546 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-03-09 01:28:48,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 260 flow [2025-03-09 01:28:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:28:48,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-09 01:28:48,547 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 182 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:28:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 260 flow [2025-03-09 01:28:48,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:48,549 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 171 flow [2025-03-09 01:28:48,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-09 01:28:48,549 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-09 01:28:48,549 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 171 flow [2025-03-09 01:28:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:48,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash -231076251, now seen corresponding path program 1 times [2025-03-09 01:28:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80968002] [2025-03-09 01:28:48,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:28:48,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:28:48,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80968002] [2025-03-09 01:28:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80968002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857140136] [2025-03-09 01:28:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:48,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:48,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-03-09 01:28:48,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:48,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,955 INFO L124 PetriNetUnfolderBase]: 1613/2634 cut-off events. [2025-03-09 01:28:48,955 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-03-09 01:28:48,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 2634 events. 1613/2634 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13727 event pairs, 1376 based on Foata normal form. 0/2063 useless extension candidates. Maximal degree in co-relation 4719. Up to 2220 conditions per place. [2025-03-09 01:28:48,966 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-03-09 01:28:48,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 243 flow [2025-03-09 01:28:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-09 01:28:48,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2025-03-09 01:28:48,968 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 171 flow. Second operand 5 states and 107 transitions. [2025-03-09 01:28:48,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 243 flow [2025-03-09 01:28:48,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:48,969 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-03-09 01:28:48,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-09 01:28:48,970 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-09 01:28:48,970 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-03-09 01:28:48,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-03-09 01:28:48,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:28:48,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1843473174, now seen corresponding path program 1 times [2025-03-09 01:28:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252362053] [2025-03-09 01:28:48,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:28:48,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:28:48,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252362053] [2025-03-09 01:28:49,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252362053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898370766] [2025-03-09 01:28:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:49,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:49,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:49,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-09 01:28:49,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:49,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,138 INFO L124 PetriNetUnfolderBase]: 1499/2410 cut-off events. [2025-03-09 01:28:49,139 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-09 01:28:49,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 2410 events. 1499/2410 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12007 event pairs, 577 based on Foata normal form. 77/1916 useless extension candidates. Maximal degree in co-relation 4790. Up to 1517 conditions per place. [2025-03-09 01:28:49,146 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 52 selfloop transitions, 2 changer transitions 3/65 dead transitions. [2025-03-09 01:28:49,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 319 flow [2025-03-09 01:28:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-09 01:28:49,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 01:28:49,147 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 3 states and 100 transitions. [2025-03-09 01:28:49,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 319 flow [2025-03-09 01:28:49,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:49,148 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 152 flow [2025-03-09 01:28:49,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-03-09 01:28:49,149 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-09 01:28:49,150 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 152 flow [2025-03-09 01:28:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-09 01:28:49,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:28:49,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1266692230, now seen corresponding path program 1 times [2025-03-09 01:28:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454879236] [2025-03-09 01:28:49,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:28:49,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:28:49,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:49,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454879236] [2025-03-09 01:28:49,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454879236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18961592] [2025-03-09 01:28:49,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:49,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:49,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:49,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03-09 01:28:49,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:49,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,306 INFO L124 PetriNetUnfolderBase]: 1318/2143 cut-off events. [2025-03-09 01:28:49,306 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-09 01:28:49,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 2143 events. 1318/2143 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10351 event pairs, 527 based on Foata normal form. 18/1788 useless extension candidates. Maximal degree in co-relation 4726. Up to 1772 conditions per place. [2025-03-09 01:28:49,313 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 47 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-09 01:28:49,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 278 flow [2025-03-09 01:28:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-09 01:28:49,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-09 01:28:49,314 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 152 flow. Second operand 3 states and 93 transitions. [2025-03-09 01:28:49,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 278 flow [2025-03-09 01:28:49,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 272 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:49,316 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 169 flow [2025-03-09 01:28:49,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-09 01:28:49,318 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2025-03-09 01:28:49,318 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 169 flow [2025-03-09 01:28:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03-09 01:28:49,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:28:49,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 956840605, now seen corresponding path program 1 times [2025-03-09 01:28:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065018803] [2025-03-09 01:28:49,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:28:49,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:28:49,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:28:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065018803] [2025-03-09 01:28:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065018803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135709625] [2025-03-09 01:28:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:49,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:49,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:49,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,509 INFO L124 PetriNetUnfolderBase]: 964/1606 cut-off events. [2025-03-09 01:28:49,509 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2025-03-09 01:28:49,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1606 events. 964/1606 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7433 event pairs, 704 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 3794. Up to 1366 conditions per place. [2025-03-09 01:28:49,515 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 37 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-09 01:28:49,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 243 flow [2025-03-09 01:28:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-09 01:28:49,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-09 01:28:49,517 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 169 flow. Second operand 4 states and 90 transitions. [2025-03-09 01:28:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 243 flow [2025-03-09 01:28:49,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 230 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:49,519 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 156 flow [2025-03-09 01:28:49,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-09 01:28:49,519 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-09 01:28:49,519 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 156 flow [2025-03-09 01:28:49,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:28:49,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 422815254, now seen corresponding path program 1 times [2025-03-09 01:28:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822318012] [2025-03-09 01:28:49,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:28:49,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:28:49,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:28:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822318012] [2025-03-09 01:28:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822318012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839758224] [2025-03-09 01:28:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:49,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:49,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:49,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-09 01:28:49,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:49,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,744 INFO L124 PetriNetUnfolderBase]: 1205/2003 cut-off events. [2025-03-09 01:28:49,744 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-03-09 01:28:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 2003 events. 1205/2003 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9334 event pairs, 906 based on Foata normal form. 64/1901 useless extension candidates. Maximal degree in co-relation 4412. Up to 1374 conditions per place. [2025-03-09 01:28:49,751 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 37 selfloop transitions, 2 changer transitions 19/66 dead transitions. [2025-03-09 01:28:49,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 322 flow [2025-03-09 01:28:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 01:28:49,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-03-09 01:28:49,753 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 156 flow. Second operand 4 states and 117 transitions. [2025-03-09 01:28:49,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 322 flow [2025-03-09 01:28:49,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:49,755 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 154 flow [2025-03-09 01:28:49,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-09 01:28:49,757 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-09 01:28:49,757 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 154 flow [2025-03-09 01:28:49,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-09 01:28:49,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:28:49,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:49,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1506081900, now seen corresponding path program 1 times [2025-03-09 01:28:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114712872] [2025-03-09 01:28:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:28:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:28:49,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:28:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114712872] [2025-03-09 01:28:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114712872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:28:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057456536] [2025-03-09 01:28:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:49,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:49,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:49,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-03-09 01:28:49,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:50,037 INFO L124 PetriNetUnfolderBase]: 663/1152 cut-off events. [2025-03-09 01:28:50,037 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-03-09 01:28:50,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1152 events. 663/1152 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5188 event pairs, 474 based on Foata normal form. 86/1148 useless extension candidates. Maximal degree in co-relation 2514. Up to 945 conditions per place. [2025-03-09 01:28:50,041 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 35 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-03-09 01:28:50,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 220 flow [2025-03-09 01:28:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:28:50,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-09 01:28:50,042 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 154 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:28:50,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 220 flow [2025-03-09 01:28:50,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:50,043 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 146 flow [2025-03-09 01:28:50,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-03-09 01:28:50,044 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-09 01:28:50,044 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 146 flow [2025-03-09 01:28:50,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-03-09 01:28:50,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:50,044 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] [2025-03-09 01:28:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:28:50,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -873602252, now seen corresponding path program 1 times [2025-03-09 01:28:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052427938] [2025-03-09 01:28:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:50,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:28:50,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:50,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:50,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052427938] [2025-03-09 01:28:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052427938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:28:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499251916] [2025-03-09 01:28:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:50,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:28:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:50,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:28:50,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:28:50,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:50,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 146 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-03-09 01:28:50,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:50,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:50,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:50,443 INFO L124 PetriNetUnfolderBase]: 1274/2030 cut-off events. [2025-03-09 01:28:50,443 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES. [2025-03-09 01:28:50,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 2030 events. 1274/2030 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10578 event pairs, 307 based on Foata normal form. 1/1992 useless extension candidates. Maximal degree in co-relation 4624. Up to 775 conditions per place. [2025-03-09 01:28:50,449 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 82 selfloop transitions, 9 changer transitions 10/107 dead transitions. [2025-03-09 01:28:50,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 521 flow [2025-03-09 01:28:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-09 01:28:50,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2025-03-09 01:28:50,452 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 146 flow. Second operand 8 states and 207 transitions. [2025-03-09 01:28:50,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 521 flow [2025-03-09 01:28:50,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:50,454 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 193 flow [2025-03-09 01:28:50,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-03-09 01:28:50,455 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-03-09 01:28:50,455 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 193 flow [2025-03-09 01:28:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-03-09 01:28:50,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:50,456 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-03-09 01:28:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:28:50,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1117180568, now seen corresponding path program 1 times [2025-03-09 01:28:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856419284] [2025-03-09 01:28:50,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:50,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:50,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856419284] [2025-03-09 01:28:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856419284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378032425] [2025-03-09 01:28:50,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:50,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:50,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:50,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:50,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:28:50,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:50,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:50,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:28:50,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:50,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378032425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:50,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-09 01:28:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739088771] [2025-03-09 01:28:50,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:50,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:28:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:50,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:28:50,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:28:50,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:50,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 193 flow. Second operand has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 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-03-09 01:28:50,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:50,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:51,256 INFO L124 PetriNetUnfolderBase]: 1661/3049 cut-off events. [2025-03-09 01:28:51,257 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2025-03-09 01:28:51,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7419 conditions, 3049 events. 1661/3049 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18620 event pairs, 909 based on Foata normal form. 112/3010 useless extension candidates. Maximal degree in co-relation 7403. Up to 1488 conditions per place. [2025-03-09 01:28:51,264 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 70 selfloop transitions, 15 changer transitions 6/102 dead transitions. [2025-03-09 01:28:51,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 552 flow [2025-03-09 01:28:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:28:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:28:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2025-03-09 01:28:51,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4203703703703704 [2025-03-09 01:28:51,266 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 193 flow. Second operand 9 states and 227 transitions. [2025-03-09 01:28:51,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 552 flow [2025-03-09 01:28:51,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 545 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:51,269 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 296 flow [2025-03-09 01:28:51,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-03-09 01:28:51,270 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-03-09 01:28:51,270 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 296 flow [2025-03-09 01:28:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 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-03-09 01:28:51,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:51,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:51,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:28:51,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:28:51,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:51,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1106820846, now seen corresponding path program 1 times [2025-03-09 01:28:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596550273] [2025-03-09 01:28:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:51,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:51,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:51,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:51,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:51,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596550273] [2025-03-09 01:28:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596550273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:51,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244547233] [2025-03-09 01:28:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:51,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:51,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:51,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:51,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:51,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-09 01:28:51,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:51,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:51,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:51,827 INFO L124 PetriNetUnfolderBase]: 2547/4806 cut-off events. [2025-03-09 01:28:51,827 INFO L125 PetriNetUnfolderBase]: For 4077/4235 co-relation queries the response was YES. [2025-03-09 01:28:51,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12257 conditions, 4806 events. 2547/4806 cut-off events. For 4077/4235 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 32146 event pairs, 732 based on Foata normal form. 132/4685 useless extension candidates. Maximal degree in co-relation 9510. Up to 1370 conditions per place. [2025-03-09 01:28:51,847 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 81 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2025-03-09 01:28:51,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 613 flow [2025-03-09 01:28:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-09 01:28:51,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:28:51,849 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 296 flow. Second operand 4 states and 130 transitions. [2025-03-09 01:28:51,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 613 flow [2025-03-09 01:28:51,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 596 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:51,855 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 340 flow [2025-03-09 01:28:51,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-03-09 01:28:51,856 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2025-03-09 01:28:51,856 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 340 flow [2025-03-09 01:28:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-09 01:28:51,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:51,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:28:51,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1654381450, now seen corresponding path program 2 times [2025-03-09 01:28:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523873014] [2025-03-09 01:28:51,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:51,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:28:51,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:51,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523873014] [2025-03-09 01:28:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523873014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150235912] [2025-03-09 01:28:52,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:52,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:52,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:28:52,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:28:52,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:52,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:28:52,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:52,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:52,990 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:28:52,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-09 01:28:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150235912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:53,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-09 01:28:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419887668] [2025-03-09 01:28:53,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:53,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:28:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:53,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:28:53,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:28:53,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:53,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 340 flow. Second operand has 30 states, 30 states have (on average 16.866666666666667) internal successors, (506), 30 states have internal predecessors, (506), 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-03-09 01:28:53,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:53,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:53,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:56,566 INFO L124 PetriNetUnfolderBase]: 13528/22273 cut-off events. [2025-03-09 01:28:56,566 INFO L125 PetriNetUnfolderBase]: For 29647/30625 co-relation queries the response was YES. [2025-03-09 01:28:56,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64408 conditions, 22273 events. 13528/22273 cut-off events. For 29647/30625 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 164529 event pairs, 2152 based on Foata normal form. 135/21573 useless extension candidates. Maximal degree in co-relation 53049. Up to 4915 conditions per place. [2025-03-09 01:28:56,697 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 346 selfloop transitions, 91 changer transitions 0/446 dead transitions. [2025-03-09 01:28:56,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 446 transitions, 2941 flow [2025-03-09 01:28:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-09 01:28:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-09 01:28:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 961 transitions. [2025-03-09 01:28:56,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.390650406504065 [2025-03-09 01:28:56,701 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 340 flow. Second operand 41 states and 961 transitions. [2025-03-09 01:28:56,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 446 transitions, 2941 flow [2025-03-09 01:28:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 446 transitions, 2895 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:56,724 INFO L231 Difference]: Finished difference. Result has 135 places, 143 transitions, 1195 flow [2025-03-09 01:28:56,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1195, PETRI_PLACES=135, PETRI_TRANSITIONS=143} [2025-03-09 01:28:56,725 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 76 predicate places. [2025-03-09 01:28:56,725 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 143 transitions, 1195 flow [2025-03-09 01:28:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 16.866666666666667) internal successors, (506), 30 states have internal predecessors, (506), 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-03-09 01:28:56,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:56,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:56,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:56,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:28:56,929 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:56,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -528995712, now seen corresponding path program 3 times [2025-03-09 01:28:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773898973] [2025-03-09 01:28:56,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:56,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-03-09 01:28:56,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 40 statements. [2025-03-09 01:28:56,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:28:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773898973] [2025-03-09 01:28:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773898973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:57,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131170209] [2025-03-09 01:28:57,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:57,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:57,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:57,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:57,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 143 transitions, 1195 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-03-09 01:28:57,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:57,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:57,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:58,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L99-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][175], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 500#(<= ~q2_back~0 ~q2_front~0), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:28:58,660 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L87-->L93: Formula: (let ((.cse1 (* 4 v_~q2_front~0_68))) (let ((.cse0 (+ v_~q2~0.offset_47 .cse1))) (and (= (+ v_~q2_front~0_68 1) v_~q2_front~0_67) (= (select |v_#valid_154| v_~q2~0.base_51) 1) (<= 0 .cse0) (not (= (ite (and (< v_~q2_front~0_68 v_~n2~0_78) (< v_~q2_front~0_68 v_~q2_back~0_75) (<= 0 v_~q2_front~0_68)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~k~0#1_3| (select (select |v_#memory_int#1_44| v_~q2~0.base_51) .cse0)) (<= (+ v_~q2~0.offset_47 .cse1 4) (select |v_#length_121| v_~q2~0.base_51))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, #valid=|v_#valid_154|, ~q2_front~0=v_~q2_front~0_68, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, #memory_int#1=|v_#memory_int#1_44|, ~q2_back~0=v_~q2_back~0_75} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_67, #memory_int#1=|v_#memory_int#1_44|, thread3Thread1of1ForFork2_#t~post11#1=|v_thread3Thread1of1ForFork2_#t~post11#1_1|, #valid=|v_#valid_154|, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, ~q2_back~0=v_~q2_back~0_75, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork2_~k~0#1][124], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 50#L93true, 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:28:58,660 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,660 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L99-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][175], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 5#L71true, Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 500#(<= ~q2_back~0 ~q2_front~0), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:28:58,714 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L87-->L93: Formula: (let ((.cse1 (* 4 v_~q2_front~0_68))) (let ((.cse0 (+ v_~q2~0.offset_47 .cse1))) (and (= (+ v_~q2_front~0_68 1) v_~q2_front~0_67) (= (select |v_#valid_154| v_~q2~0.base_51) 1) (<= 0 .cse0) (not (= (ite (and (< v_~q2_front~0_68 v_~n2~0_78) (< v_~q2_front~0_68 v_~q2_back~0_75) (<= 0 v_~q2_front~0_68)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~k~0#1_3| (select (select |v_#memory_int#1_44| v_~q2~0.base_51) .cse0)) (<= (+ v_~q2~0.offset_47 .cse1 4) (select |v_#length_121| v_~q2~0.base_51))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, #valid=|v_#valid_154|, ~q2_front~0=v_~q2_front~0_68, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, #memory_int#1=|v_#memory_int#1_44|, ~q2_back~0=v_~q2_back~0_75} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_67, #memory_int#1=|v_#memory_int#1_44|, thread3Thread1of1ForFork2_#t~post11#1=|v_thread3Thread1of1ForFork2_#t~post11#1_1|, #valid=|v_#valid_154|, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, ~q2_back~0=v_~q2_back~0_75, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork2_~k~0#1][124], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 50#L93true, 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 5#L71true, Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:28:58,714 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:28:58,714 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:28:58,859 INFO L124 PetriNetUnfolderBase]: 13247/22183 cut-off events. [2025-03-09 01:28:58,859 INFO L125 PetriNetUnfolderBase]: For 107365/108317 co-relation queries the response was YES. [2025-03-09 01:28:58,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83224 conditions, 22183 events. 13247/22183 cut-off events. For 107365/108317 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 166280 event pairs, 3396 based on Foata normal form. 220/22283 useless extension candidates. Maximal degree in co-relation 82281. Up to 12066 conditions per place. [2025-03-09 01:28:59,017 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 134 selfloop transitions, 42 changer transitions 0/185 dead transitions. [2025-03-09 01:28:59,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 185 transitions, 1798 flow [2025-03-09 01:28:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-09 01:28:59,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-09 01:28:59,020 INFO L175 Difference]: Start difference. First operand has 135 places, 143 transitions, 1195 flow. Second operand 6 states and 156 transitions. [2025-03-09 01:28:59,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 185 transitions, 1798 flow [2025-03-09 01:28:59,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 1660 flow, removed 58 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:59,265 INFO L231 Difference]: Finished difference. Result has 138 places, 145 transitions, 1214 flow [2025-03-09 01:28:59,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1214, PETRI_PLACES=138, PETRI_TRANSITIONS=145} [2025-03-09 01:28:59,265 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 79 predicate places. [2025-03-09 01:28:59,265 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 145 transitions, 1214 flow [2025-03-09 01:28:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-03-09 01:28:59,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:59,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:59,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:28:59,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:59,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1214646522, now seen corresponding path program 1 times [2025-03-09 01:28:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606332260] [2025-03-09 01:28:59,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:28:59,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:28:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:59,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606332260] [2025-03-09 01:28:59,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606332260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:59,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966128881] [2025-03-09 01:28:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:59,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:59,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:59,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:59,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:28:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:28:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:28:59,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:59,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:28:59,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:59,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966128881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-09 01:28:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673820558] [2025-03-09 01:28:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:59,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:59,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:28:59,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:28:59,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 145 transitions, 1214 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-09 01:28:59,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:59,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:28:59,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:00,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,688 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-09 01:29:00,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:00,688 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-03-09 01:29:00,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:00,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,695 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-09 01:29:00,695 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:00,695 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:00,695 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-03-09 01:29:00,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,779 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:00,779 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:29:00,779 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,779 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 32#L47true, 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:00,784 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:00,784 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,784 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:29:00,784 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,788 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:00,789 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:29:00,789 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,789 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 38#thread1EXITtrue, 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,791 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:00,791 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,791 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-09 01:29:00,791 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:00,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 32#L47true, 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,877 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:00,877 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,877 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:29:00,877 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 45#L54true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:00,883 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:00,883 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,883 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:29:00,883 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 38#thread1EXITtrue, 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,887 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:00,887 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:29:00,887 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,887 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:00,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 45#L54true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,973 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-09 01:29:00,973 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:00,973 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:00,973 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:00,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 41#L122true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:00,977 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-09 01:29:00,977 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:00,977 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:00,977 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:01,361 INFO L124 PetriNetUnfolderBase]: 10916/19226 cut-off events. [2025-03-09 01:29:01,361 INFO L125 PetriNetUnfolderBase]: For 128947/131041 co-relation queries the response was YES. [2025-03-09 01:29:01,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77300 conditions, 19226 events. 10916/19226 cut-off events. For 128947/131041 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 148761 event pairs, 3378 based on Foata normal form. 720/19471 useless extension candidates. Maximal degree in co-relation 76324. Up to 10281 conditions per place. [2025-03-09 01:29:01,519 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 136 selfloop transitions, 26 changer transitions 23/201 dead transitions. [2025-03-09 01:29:01,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 201 transitions, 1905 flow [2025-03-09 01:29:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-09 01:29:01,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-09 01:29:01,520 INFO L175 Difference]: Start difference. First operand has 138 places, 145 transitions, 1214 flow. Second operand 4 states and 136 transitions. [2025-03-09 01:29:01,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 201 transitions, 1905 flow [2025-03-09 01:29:01,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 1887 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:01,780 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 1245 flow [2025-03-09 01:29:01,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1245, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-03-09 01:29:01,781 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 82 predicate places. [2025-03-09 01:29:01,781 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 1245 flow [2025-03-09 01:29:01,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-09 01:29:01,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:01,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:01,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:29:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:01,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:29:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1323019094, now seen corresponding path program 1 times [2025-03-09 01:29:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992288627] [2025-03-09 01:29:01,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:01,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:29:01,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:01,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:29:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992288627] [2025-03-09 01:29:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992288627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776691224] [2025-03-09 01:29:02,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:02,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:02,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:02,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:02,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:29:02,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:29:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:29:02,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:29:02,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:29:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776691224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:02,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-09 01:29:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776448843] [2025-03-09 01:29:02,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:02,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:29:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:02,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:29:02,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:29:02,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-09 01:29:02,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 1245 flow. Second operand has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 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-03-09 01:29:02,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:02,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-09 01:29:02,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:03,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:03,413 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-09 01:29:03,413 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:29:03,413 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,413 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,420 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-09 01:29:03,420 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,420 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-09 01:29:03,420 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:03,446 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,446 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,446 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,446 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), 32#L47true, Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,449 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,449 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,450 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,450 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,454 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,454 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,454 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,454 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 38#thread1EXITtrue, 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,457 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:29:03,457 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,457 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 45#L54true, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:03,481 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:03,481 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,481 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-09 01:29:03,481 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), 32#L47true, Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:03,486 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:03,486 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,486 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-09 01:29:03,486 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 38#thread1EXITtrue, 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,490 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-09 01:29:03,490 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:29:03,490 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,490 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-09 01:29:03,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 45#L54true, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), Black: 226#(<= ~q2_back~0 ~q2_front~0), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-09 01:29:03,510 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-09 01:29:03,510 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,510 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,510 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), Black: 226#(<= ~q2_back~0 ~q2_front~0), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 41#L122true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-09 01:29:03,522 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-09 01:29:03,522 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:29:03,522 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-03-09 01:29:03,522 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-09 01:29:03,621 INFO L124 PetriNetUnfolderBase]: 7098/13356 cut-off events. [2025-03-09 01:29:03,621 INFO L125 PetriNetUnfolderBase]: For 118302/118997 co-relation queries the response was YES. [2025-03-09 01:29:03,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58101 conditions, 13356 events. 7098/13356 cut-off events. For 118302/118997 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 104531 event pairs, 3977 based on Foata normal form. 414/13547 useless extension candidates. Maximal degree in co-relation 53305. Up to 6581 conditions per place. [2025-03-09 01:29:03,695 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 59 selfloop transitions, 29 changer transitions 113/213 dead transitions. [2025-03-09 01:29:03,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 213 transitions, 2549 flow [2025-03-09 01:29:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:29:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:29:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2025-03-09 01:29:03,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2025-03-09 01:29:03,696 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 1245 flow. Second operand 9 states and 219 transitions. [2025-03-09 01:29:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 213 transitions, 2549 flow [2025-03-09 01:29:03,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 213 transitions, 2276 flow, removed 127 selfloop flow, removed 7 redundant places. [2025-03-09 01:29:03,941 INFO L231 Difference]: Finished difference. Result has 138 places, 100 transitions, 943 flow [2025-03-09 01:29:03,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2025-03-09 01:29:03,942 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 79 predicate places. [2025-03-09 01:29:03,942 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 943 flow [2025-03-09 01:29:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 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-03-09 01:29:03,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:03,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:03,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:04,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:04,143 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:29:04,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1320217270, now seen corresponding path program 2 times [2025-03-09 01:29:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:04,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474565442] [2025-03-09 01:29:04,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:04,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:29:04,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:29:04,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:29:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474565442] [2025-03-09 01:29:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474565442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598517764] [2025-03-09 01:29:04,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:04,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:04,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:04,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:29:04,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:29:04,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:29:04,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:04,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:04,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:29:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:05,005 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-03-09 01:29:05,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2025-03-09 01:29:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:29:05,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:05,405 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-03-09 01:29:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-03-09 01:29:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:29:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598517764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:05,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2025-03-09 01:29:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106481192] [2025-03-09 01:29:05,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:29:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:29:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:29:05,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:29:05,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 943 flow. Second operand has 32 states, 32 states have (on average 15.21875) internal successors, (487), 32 states have internal predecessors, (487), 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-03-09 01:29:05,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:05,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:29:05,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:10,256 INFO L124 PetriNetUnfolderBase]: 26484/40850 cut-off events. [2025-03-09 01:29:10,256 INFO L125 PetriNetUnfolderBase]: For 207886/207886 co-relation queries the response was YES. [2025-03-09 01:29:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158625 conditions, 40850 events. 26484/40850 cut-off events. For 207886/207886 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 296084 event pairs, 2322 based on Foata normal form. 877/39415 useless extension candidates. Maximal degree in co-relation 148089. Up to 6931 conditions per place. [2025-03-09 01:29:10,586 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 367 selfloop transitions, 92 changer transitions 37/502 dead transitions. [2025-03-09 01:29:10,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 502 transitions, 5313 flow [2025-03-09 01:29:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:29:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-09 01:29:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 649 transitions. [2025-03-09 01:29:10,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4006172839506173 [2025-03-09 01:29:10,588 INFO L175 Difference]: Start difference. First operand has 138 places, 100 transitions, 943 flow. Second operand 27 states and 649 transitions. [2025-03-09 01:29:10,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 502 transitions, 5313 flow [2025-03-09 01:29:11,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 502 transitions, 4395 flow, removed 422 selfloop flow, removed 12 redundant places. [2025-03-09 01:29:11,258 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 1855 flow [2025-03-09 01:29:11,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1855, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2025-03-09 01:29:11,259 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 96 predicate places. [2025-03-09 01:29:11,259 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 1855 flow [2025-03-09 01:29:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 15.21875) internal successors, (487), 32 states have internal predecessors, (487), 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-03-09 01:29:11,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:11,259 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:11,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:29:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:29:11,464 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:29:11,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1754405102, now seen corresponding path program 3 times [2025-03-09 01:29:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045500352] [2025-03-09 01:29:11,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:11,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-09 01:29:11,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-03-09 01:29:11,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:29:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:29:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045500352] [2025-03-09 01:29:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045500352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983429641] [2025-03-09 01:29:11,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:11,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:11,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:11,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:11,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:29:11,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-09 01:29:11,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-03-09 01:29:11,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:29:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:29:11,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:29:11,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:11,939 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-03-09 01:29:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-03-09 01:29:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:29:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983429641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:12,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-09 01:29:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561749055] [2025-03-09 01:29:12,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:29:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:29:12,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:29:12,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:29:12,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 1855 flow. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 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-03-09 01:29:12,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:12,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:29:12,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:16,345 INFO L124 PetriNetUnfolderBase]: 27145/42357 cut-off events. [2025-03-09 01:29:16,345 INFO L125 PetriNetUnfolderBase]: For 272775/272775 co-relation queries the response was YES. [2025-03-09 01:29:16,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184186 conditions, 42357 events. 27145/42357 cut-off events. For 272775/272775 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 310790 event pairs, 2429 based on Foata normal form. 1603/43954 useless extension candidates. Maximal degree in co-relation 181306. Up to 11227 conditions per place. [2025-03-09 01:29:16,706 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 323 selfloop transitions, 70 changer transitions 0/399 dead transitions. [2025-03-09 01:29:16,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 399 transitions, 5049 flow [2025-03-09 01:29:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:29:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:29:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 300 transitions. [2025-03-09 01:29:16,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-09 01:29:16,707 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 1855 flow. Second operand 12 states and 300 transitions. [2025-03-09 01:29:16,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 399 transitions, 5049 flow [2025-03-09 01:29:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 399 transitions, 4832 flow, removed 98 selfloop flow, removed 6 redundant places. [2025-03-09 01:29:17,565 INFO L231 Difference]: Finished difference. Result has 162 places, 193 transitions, 2208 flow [2025-03-09 01:29:17,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2208, PETRI_PLACES=162, PETRI_TRANSITIONS=193} [2025-03-09 01:29:17,566 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 103 predicate places. [2025-03-09 01:29:17,566 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 193 transitions, 2208 flow [2025-03-09 01:29:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 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-03-09 01:29:17,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:17,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:17,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:17,766 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:29:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -757099688, now seen corresponding path program 1 times [2025-03-09 01:29:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102130525] [2025-03-09 01:29:17,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:29:17,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:29:17,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:17,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102130525] [2025-03-09 01:29:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102130525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146003312] [2025-03-09 01:29:19,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:19,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:19,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:29:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:29:19,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:29:19,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 01:29:19,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:20,083 INFO L349 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2025-03-09 01:29:20,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2025-03-09 01:29:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:20,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:20,815 INFO L349 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-03-09 01:29:20,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-03-09 01:29:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146003312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:21,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 60 [2025-03-09 01:29:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529742749] [2025-03-09 01:29:21,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:21,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-09 01:29:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-09 01:29:21,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3298, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 01:29:22,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2025-03-09 01:29:22,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 193 transitions, 2208 flow. Second operand has 61 states, 61 states have (on average 13.081967213114755) internal successors, (798), 61 states have internal predecessors, (798), 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-03-09 01:29:22,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:22,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2025-03-09 01:29:22,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand