./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu --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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:54:38,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:54:38,958 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:54:38,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:54:38,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:54:39,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:54:39,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:54:39,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:54:39,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:54:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:54:39,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:54:39,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:54:39,029 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:54:39,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:54:39,031 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:54:39,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:54:39,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:54:39,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:54:39,033 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:54:39,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:54:39,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:54:39,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:54:39,035 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:54:39,036 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:54:39,036 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:54:39,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:54:39,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:54:39,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:54:39,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:54:39,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:39,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:54:39,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:54:39,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:54:39,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:54:39,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:54:39,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:54:39,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:54:39,041 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:54:39,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2023-11-19 07:54:39,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:54:39,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:54:39,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:54:39,341 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:54:39,342 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:54:39,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2023-11-19 07:54:42,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:54:42,909 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:54:42,909 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2023-11-19 07:54:42,931 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/data/771431fa5/001a61a8b3e94a8197feacbefc2aadc1/FLAG9dc2f713a [2023-11-19 07:54:42,949 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/data/771431fa5/001a61a8b3e94a8197feacbefc2aadc1 [2023-11-19 07:54:42,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:54:42,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:54:42,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:42,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:54:42,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:54:42,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:42" (1/1) ... [2023-11-19 07:54:42,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b3751e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:42, skipping insertion in model container [2023-11-19 07:54:42,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:42" (1/1) ... [2023-11-19 07:54:43,049 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:54:43,474 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:54:43,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:43,648 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:54:43,678 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:54:43,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:43,763 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:54:43,772 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:54:43,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43 WrapperNode [2023-11-19 07:54:43,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:43,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:43,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:54:43,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:54:43,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,837 INFO L138 Inliner]: procedures = 273, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2023-11-19 07:54:43,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:43,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:54:43,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:54:43,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:54:43,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:54:43,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:54:43,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:54:43,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:54:43,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (1/1) ... [2023-11-19 07:54:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:43,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:54:43,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:54:43,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:54:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-19 07:54:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-19 07:54:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:54:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:54:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:54:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 07:54:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:54:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:54:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:54:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:54:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:54:43,998 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:54:44,242 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:54:44,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:54:44,487 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:54:44,497 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:54:44,497 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:54:44,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:44 BoogieIcfgContainer [2023-11-19 07:54:44,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:54:44,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:54:44,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:54:44,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:54:44,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:54:42" (1/3) ... [2023-11-19 07:54:44,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4a38e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:44, skipping insertion in model container [2023-11-19 07:54:44,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:43" (2/3) ... [2023-11-19 07:54:44,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4a38e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:44, skipping insertion in model container [2023-11-19 07:54:44,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:44" (3/3) ... [2023-11-19 07:54:44,516 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12-pthread.i [2023-11-19 07:54:44,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:54:44,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-19 07:54:44,538 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:54:44,607 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:54:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,734 INFO L124 PetriNetUnfolderBase]: 8/111 cut-off events. [2023-11-19 07:54:44,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:44,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 111 events. 8/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-11-19 07:54:44,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,750 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:54:44,760 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,763 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 94 transitions, 192 flow [2023-11-19 07:54:44,795 INFO L124 PetriNetUnfolderBase]: 8/111 cut-off events. [2023-11-19 07:54:44,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:44,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 111 events. 8/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-11-19 07:54:44,798 INFO L119 LiptonReduction]: Number of co-enabled transitions 1480 [2023-11-19 07:54:49,425 INFO L134 LiptonReduction]: Checked pairs total: 1579 [2023-11-19 07:54:49,425 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-11-19 07:54:49,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:54:49,452 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4fc3d901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:54:49,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:54:49,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:54:49,455 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:54:49,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:49,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:49,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:54:49,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:49,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 12809, now seen corresponding path program 1 times [2023-11-19 07:54:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:49,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301017015] [2023-11-19 07:54:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301017015] [2023-11-19 07:54:49,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301017015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:49,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:49,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891701132] [2023-11-19 07:54:49,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:49,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:49,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:50,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 203 [2023-11-19 07:54:50,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) [2023-11-19 07:54:50,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:50,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 203 [2023-11-19 07:54:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:50,071 INFO L124 PetriNetUnfolderBase]: 19/47 cut-off events. [2023-11-19 07:54:50,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:50,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 47 events. 19/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 124 event pairs, 15 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 84. Up to 46 conditions per place. [2023-11-19 07:54:50,077 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 10 selfloop transitions, 1 changer transitions 0/12 dead transitions. [2023-11-19 07:54:50,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 12 transitions, 50 flow [2023-11-19 07:54:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-11-19 07:54:50,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121510673234811 [2023-11-19 07:54:50,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:50,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2023-11-19 07:54:50,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:50,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:50,134 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 34 flow. Second operand 3 states and 251 transitions. [2023-11-19 07:54:50,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 12 transitions, 50 flow [2023-11-19 07:54:50,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:50,140 INFO L231 Difference]: Finished difference. Result has 16 places, 12 transitions, 30 flow [2023-11-19 07:54:50,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=30, PETRI_PLACES=16, PETRI_TRANSITIONS=12} [2023-11-19 07:54:50,148 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-19 07:54:50,148 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 12 transitions, 30 flow [2023-11-19 07:54:50,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) [2023-11-19 07:54:50,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:50,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:54:50,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:54:50,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:50,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash 12810, now seen corresponding path program 1 times [2023-11-19 07:54:50,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158992659] [2023-11-19 07:54:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158992659] [2023-11-19 07:54:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158992659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697412977] [2023-11-19 07:54:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:50,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:50,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:50,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 203 [2023-11-19 07:54:50,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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) [2023-11-19 07:54:50,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:50,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 203 [2023-11-19 07:54:50,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:50,378 INFO L124 PetriNetUnfolderBase]: 13/34 cut-off events. [2023-11-19 07:54:50,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:50,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 13/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 77 event pairs, 10 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 67. Up to 33 conditions per place. [2023-11-19 07:54:50,382 INFO L140 encePairwiseOnDemand]: 201/203 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-11-19 07:54:50,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 48 flow [2023-11-19 07:54:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-11-19 07:54:50,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121510673234811 [2023-11-19 07:54:50,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:50,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-11-19 07:54:50,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2023-11-19 07:54:50,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:50,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:50,397 INFO L175 Difference]: Start difference. First operand has 16 places, 12 transitions, 30 flow. Second operand 3 states and 251 transitions. [2023-11-19 07:54:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 11 transitions, 48 flow [2023-11-19 07:54:50,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:50,400 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 29 flow [2023-11-19 07:54:50,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29, PETRI_PLACES=16, PETRI_TRANSITIONS=11} [2023-11-19 07:54:50,406 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-19 07:54:50,406 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 29 flow [2023-11-19 07:54:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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) [2023-11-19 07:54:50,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:50,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:54:50,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:54:50,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:50,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash 381826209, now seen corresponding path program 1 times [2023-11-19 07:54:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065888288] [2023-11-19 07:54:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065888288] [2023-11-19 07:54:50,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065888288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:50,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:50,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715896251] [2023-11-19 07:54:50,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:50,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:54:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:54:50,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:54:50,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 203 [2023-11-19 07:54:50,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 11 transitions, 29 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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) [2023-11-19 07:54:50,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:50,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 203 [2023-11-19 07:54:50,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:50,926 INFO L124 PetriNetUnfolderBase]: 21/54 cut-off events. [2023-11-19 07:54:50,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:50,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 54 events. 21/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 156 event pairs, 10 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 107. Up to 33 conditions per place. [2023-11-19 07:54:50,928 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 13 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2023-11-19 07:54:50,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 17 transitions, 73 flow [2023-11-19 07:54:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:54:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:54:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2023-11-19 07:54:50,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39532019704433496 [2023-11-19 07:54:50,931 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 321 transitions. [2023-11-19 07:54:50,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 321 transitions. [2023-11-19 07:54:50,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:50,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 321 transitions. [2023-11-19 07:54:50,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 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) [2023-11-19 07:54:50,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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) [2023-11-19 07:54:50,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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) [2023-11-19 07:54:50,938 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 29 flow. Second operand 4 states and 321 transitions. [2023-11-19 07:54:50,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 17 transitions, 73 flow [2023-11-19 07:54:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:50,940 INFO L231 Difference]: Finished difference. Result has 19 places, 12 transitions, 42 flow [2023-11-19 07:54:50,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=12} [2023-11-19 07:54:50,942 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-11-19 07:54:50,946 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 12 transitions, 42 flow [2023-11-19 07:54:50,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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) [2023-11-19 07:54:50,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:50,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:54:50,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:54:50,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:50,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 381826221, now seen corresponding path program 1 times [2023-11-19 07:54:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906352910] [2023-11-19 07:54:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906352910] [2023-11-19 07:54:51,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906352910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:51,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:51,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903598790] [2023-11-19 07:54:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:51,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:51,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 203 [2023-11-19 07:54:51,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 12 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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) [2023-11-19 07:54:51,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:51,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 203 [2023-11-19 07:54:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:51,125 INFO L124 PetriNetUnfolderBase]: 17/44 cut-off events. [2023-11-19 07:54:51,126 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:54:51,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 44 events. 17/44 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 105 event pairs, 14 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 102. Up to 43 conditions per place. [2023-11-19 07:54:51,127 INFO L140 encePairwiseOnDemand]: 201/203 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-11-19 07:54:51,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 11 transitions, 60 flow [2023-11-19 07:54:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-11-19 07:54:51,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154351395730706 [2023-11-19 07:54:51,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-11-19 07:54:51,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-11-19 07:54:51,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:51,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-11-19 07:54:51,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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) [2023-11-19 07:54:51,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:51,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-11-19 07:54:51,134 INFO L175 Difference]: Start difference. First operand has 19 places, 12 transitions, 42 flow. Second operand 3 states and 253 transitions. [2023-11-19 07:54:51,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 11 transitions, 60 flow [2023-11-19 07:54:51,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 11 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:54:51,136 INFO L231 Difference]: Finished difference. Result has 18 places, 11 transitions, 38 flow [2023-11-19 07:54:51,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=18, PETRI_TRANSITIONS=11} [2023-11-19 07:54:51,137 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 1 predicate places. [2023-11-19 07:54:51,137 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 11 transitions, 38 flow [2023-11-19 07:54:51,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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) [2023-11-19 07:54:51,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:51,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:54:51,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:54:51,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:51,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 381826220, now seen corresponding path program 1 times [2023-11-19 07:54:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134500335] [2023-11-19 07:54:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134500335] [2023-11-19 07:54:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134500335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861968168] [2023-11-19 07:54:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:51,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:54:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:54:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:54:51,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 203 [2023-11-19 07:54:51,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 11 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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) [2023-11-19 07:54:51,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:51,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 203 [2023-11-19 07:54:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:51,572 INFO L124 PetriNetUnfolderBase]: 13/34 cut-off events. [2023-11-19 07:54:51,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:54:51,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 34 events. 13/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 6 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 79. Up to 23 conditions per place. [2023-11-19 07:54:51,578 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 9 selfloop transitions, 3 changer transitions 0/13 dead transitions. [2023-11-19 07:54:51,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 66 flow [2023-11-19 07:54:51,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:54:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:54:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2023-11-19 07:54:51,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817733990147783 [2023-11-19 07:54:51,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 310 transitions. [2023-11-19 07:54:51,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 310 transitions. [2023-11-19 07:54:51,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:51,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 310 transitions. [2023-11-19 07:54:51,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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) [2023-11-19 07:54:51,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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) [2023-11-19 07:54:51,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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) [2023-11-19 07:54:51,587 INFO L175 Difference]: Start difference. First operand has 18 places, 11 transitions, 38 flow. Second operand 4 states and 310 transitions. [2023-11-19 07:54:51,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 66 flow [2023-11-19 07:54:51,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 65 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:51,588 INFO L231 Difference]: Finished difference. Result has 19 places, 10 transitions, 41 flow [2023-11-19 07:54:51,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=41, PETRI_PLACES=19, PETRI_TRANSITIONS=10} [2023-11-19 07:54:51,591 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-11-19 07:54:51,592 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 10 transitions, 41 flow [2023-11-19 07:54:51,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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) [2023-11-19 07:54:51,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:51,593 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 07:54:51,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:54:51,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 07:54:51,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1048347118, now seen corresponding path program 1 times [2023-11-19 07:54:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:51,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547386851] [2023-11-19 07:54:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:54:51,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:54:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:54:51,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:54:51,668 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:54:51,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-19 07:54:51,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-11-19 07:54:51,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:54:51,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2023-11-19 07:54:51,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 10 remaining) [2023-11-19 07:54:51,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:54:51,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2023-11-19 07:54:51,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2023-11-19 07:54:51,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-11-19 07:54:51,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2023-11-19 07:54:51,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:54:51,680 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-19 07:54:51,683 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:54:51,683 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 07:54:51,724 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:54:51,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,770 INFO L124 PetriNetUnfolderBase]: 14/168 cut-off events. [2023-11-19 07:54:51,770 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:54:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 168 events. 14/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2023-11-19 07:54:51,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,778 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:54:51,778 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,779 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 132 transitions, 274 flow [2023-11-19 07:54:51,839 INFO L124 PetriNetUnfolderBase]: 14/168 cut-off events. [2023-11-19 07:54:51,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:54:51,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 168 events. 14/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2023-11-19 07:54:51,848 INFO L119 LiptonReduction]: Number of co-enabled transitions 5772 [2023-11-19 07:54:56,289 INFO L134 LiptonReduction]: Checked pairs total: 11637 [2023-11-19 07:54:56,289 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-11-19 07:54:56,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:54:56,292 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4fc3d901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:54:56,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 07:54:56,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:54:56,295 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:54:56,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:56,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:56,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:54:56,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:56,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 22494, now seen corresponding path program 1 times [2023-11-19 07:54:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:56,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263369102] [2023-11-19 07:54:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263369102] [2023-11-19 07:54:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263369102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:56,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:56,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652073870] [2023-11-19 07:54:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:56,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:54:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:54:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:54:56,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 268 [2023-11-19 07:54:56,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 80 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 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) [2023-11-19 07:54:56,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:56,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 268 [2023-11-19 07:54:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:56,492 INFO L124 PetriNetUnfolderBase]: 447/823 cut-off events. [2023-11-19 07:54:56,492 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-19 07:54:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 823 events. 447/823 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 4950 event pairs, 263 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 704. Up to 612 conditions per place. [2023-11-19 07:54:56,503 INFO L140 encePairwiseOnDemand]: 266/268 looper letters, 18 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-19 07:54:56,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 112 flow [2023-11-19 07:54:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:54:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:54:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2023-11-19 07:54:56,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48134328358208955 [2023-11-19 07:54:56,506 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2023-11-19 07:54:56,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2023-11-19 07:54:56,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:56,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2023-11-19 07:54:56,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 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) [2023-11-19 07:54:56,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 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) [2023-11-19 07:54:56,511 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 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) [2023-11-19 07:54:56,511 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 80 flow. Second operand 2 states and 258 transitions. [2023-11-19 07:54:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 112 flow [2023-11-19 07:54:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:56,514 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 76 flow [2023-11-19 07:54:56,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-11-19 07:54:56,517 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-19 07:54:56,522 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 76 flow [2023-11-19 07:54:56,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 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) [2023-11-19 07:54:56,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:56,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:54:56,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:54:56,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:56,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 22498, now seen corresponding path program 1 times [2023-11-19 07:54:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713936644] [2023-11-19 07:54:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713936644] [2023-11-19 07:54:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713936644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747559403] [2023-11-19 07:54:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:56,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:56,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 268 [2023-11-19 07:54:56,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-11-19 07:54:56,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:56,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 268 [2023-11-19 07:54:56,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:56,739 INFO L124 PetriNetUnfolderBase]: 325/612 cut-off events. [2023-11-19 07:54:56,739 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-19 07:54:56,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 612 events. 325/612 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3467 event pairs, 187 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 1080. Up to 448 conditions per place. [2023-11-19 07:54:56,745 INFO L140 encePairwiseOnDemand]: 266/268 looper letters, 16 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-11-19 07:54:56,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 108 flow [2023-11-19 07:54:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-19 07:54:56,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44029850746268656 [2023-11-19 07:54:56,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-19 07:54:56,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-19 07:54:56,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:56,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-19 07:54:56,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-11-19 07:54:56,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:56,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:56,757 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 76 flow. Second operand 3 states and 354 transitions. [2023-11-19 07:54:56,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 108 flow [2023-11-19 07:54:56,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:56,759 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 76 flow [2023-11-19 07:54:56,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-11-19 07:54:56,761 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-11-19 07:54:56,761 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 76 flow [2023-11-19 07:54:56,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-11-19 07:54:56,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:56,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:54:56,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:54:56,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:56,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 22499, now seen corresponding path program 1 times [2023-11-19 07:54:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078322627] [2023-11-19 07:54:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078322627] [2023-11-19 07:54:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078322627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:56,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:56,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957111736] [2023-11-19 07:54:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:56,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-11-19 07:54:56,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-19 07:54:56,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:56,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-11-19 07:54:56,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:56,981 INFO L124 PetriNetUnfolderBase]: 203/401 cut-off events. [2023-11-19 07:54:56,981 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-19 07:54:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 401 events. 203/401 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2107 event pairs, 111 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 707. Up to 285 conditions per place. [2023-11-19 07:54:56,985 INFO L140 encePairwiseOnDemand]: 266/268 looper letters, 15 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-11-19 07:54:56,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 106 flow [2023-11-19 07:54:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-19 07:54:56,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427860696517413 [2023-11-19 07:54:56,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-19 07:54:56,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-19 07:54:56,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:56,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-19 07:54:56,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-11-19 07:54:56,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:56,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:56,992 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 356 transitions. [2023-11-19 07:54:56,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 106 flow [2023-11-19 07:54:56,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:56,995 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 75 flow [2023-11-19 07:54:56,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-11-19 07:54:56,997 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-11-19 07:54:56,998 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 75 flow [2023-11-19 07:54:56,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-19 07:54:56,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:56,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:56,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:54:56,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:56,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:56,999 INFO L85 PathProgramCache]: Analyzing trace with hash 343457986, now seen corresponding path program 1 times [2023-11-19 07:54:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617407092] [2023-11-19 07:54:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617407092] [2023-11-19 07:54:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617407092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855240040] [2023-11-19 07:54:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:57,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:57,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-11-19 07:54:57,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-11-19 07:54:57,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:57,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-11-19 07:54:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:57,186 INFO L124 PetriNetUnfolderBase]: 291/563 cut-off events. [2023-11-19 07:54:57,186 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 07:54:57,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 563 events. 291/563 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2951 event pairs, 129 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 1015. Up to 330 conditions per place. [2023-11-19 07:54:57,191 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 25 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-19 07:54:57,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 152 flow [2023-11-19 07:54:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-19 07:54:57,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601990049751244 [2023-11-19 07:54:57,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-19 07:54:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-19 07:54:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:57,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-19 07:54:57,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-11-19 07:54:57,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:57,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:57,199 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 75 flow. Second operand 3 states and 370 transitions. [2023-11-19 07:54:57,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 152 flow [2023-11-19 07:54:57,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:57,201 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 88 flow [2023-11-19 07:54:57,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-19 07:54:57,202 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-19 07:54:57,202 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 88 flow [2023-11-19 07:54:57,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2023-11-19 07:54:57,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:57,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:57,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:54:57,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:57,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1311402865, now seen corresponding path program 1 times [2023-11-19 07:54:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:57,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882428919] [2023-11-19 07:54:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882428919] [2023-11-19 07:54:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882428919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:57,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:54:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902628308] [2023-11-19 07:54:57,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:57,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:57,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:57,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:57,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 268 [2023-11-19 07:54:57,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-19 07:54:57,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:57,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 268 [2023-11-19 07:54:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:58,019 INFO L124 PetriNetUnfolderBase]: 741/1267 cut-off events. [2023-11-19 07:54:58,019 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-19 07:54:58,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1267 events. 741/1267 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7477 event pairs, 99 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 2709. Up to 525 conditions per place. [2023-11-19 07:54:58,031 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 75 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2023-11-19 07:54:58,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 93 transitions, 423 flow [2023-11-19 07:54:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:54:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 689 transitions. [2023-11-19 07:54:58,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4284825870646766 [2023-11-19 07:54:58,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 689 transitions. [2023-11-19 07:54:58,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 689 transitions. [2023-11-19 07:54:58,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:58,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 689 transitions. [2023-11-19 07:54:58,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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) [2023-11-19 07:54:58,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 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) [2023-11-19 07:54:58,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 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) [2023-11-19 07:54:58,043 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 88 flow. Second operand 6 states and 689 transitions. [2023-11-19 07:54:58,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 93 transitions, 423 flow [2023-11-19 07:54:58,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:54:58,047 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 169 flow [2023-11-19 07:54:58,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-19 07:54:58,048 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-19 07:54:58,048 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 169 flow [2023-11-19 07:54:58,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-19 07:54:58,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:58,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:54:58,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:58,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1311402854, now seen corresponding path program 1 times [2023-11-19 07:54:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944763626] [2023-11-19 07:54:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944763626] [2023-11-19 07:54:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944763626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97610541] [2023-11-19 07:54:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:58,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:54:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:54:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:54:58,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 268 [2023-11-19 07:54:58,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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) [2023-11-19 07:54:58,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:58,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 268 [2023-11-19 07:54:58,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:58,455 INFO L124 PetriNetUnfolderBase]: 675/1170 cut-off events. [2023-11-19 07:54:58,456 INFO L125 PetriNetUnfolderBase]: For 963/1019 co-relation queries the response was YES. [2023-11-19 07:54:58,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 1170 events. 675/1170 cut-off events. For 963/1019 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 6968 event pairs, 40 based on Foata normal form. 24/891 useless extension candidates. Maximal degree in co-relation 3018. Up to 546 conditions per place. [2023-11-19 07:54:58,469 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 47 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-11-19 07:54:58,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 390 flow [2023-11-19 07:54:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:54:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:54:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-11-19 07:54:58,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470149253731343 [2023-11-19 07:54:58,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-11-19 07:54:58,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-11-19 07:54:58,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:58,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-11-19 07:54:58,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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) [2023-11-19 07:54:58,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 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) [2023-11-19 07:54:58,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 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) [2023-11-19 07:54:58,480 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 169 flow. Second operand 5 states and 599 transitions. [2023-11-19 07:54:58,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 390 flow [2023-11-19 07:54:58,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:58,485 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 217 flow [2023-11-19 07:54:58,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-19 07:54:58,486 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-11-19 07:54:58,487 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 217 flow [2023-11-19 07:54:58,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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) [2023-11-19 07:54:58,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:58,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:58,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:54:58,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:58,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1311402866, now seen corresponding path program 1 times [2023-11-19 07:54:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320181846] [2023-11-19 07:54:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320181846] [2023-11-19 07:54:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320181846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603632055] [2023-11-19 07:54:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:58,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:58,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 268 [2023-11-19 07:54:58,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-19 07:54:58,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:58,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 268 [2023-11-19 07:54:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:58,676 INFO L124 PetriNetUnfolderBase]: 303/662 cut-off events. [2023-11-19 07:54:58,676 INFO L125 PetriNetUnfolderBase]: For 772/826 co-relation queries the response was YES. [2023-11-19 07:54:58,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 662 events. 303/662 cut-off events. For 772/826 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4228 event pairs, 175 based on Foata normal form. 48/568 useless extension candidates. Maximal degree in co-relation 1687. Up to 439 conditions per place. [2023-11-19 07:54:58,684 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 16 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-11-19 07:54:58,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 245 flow [2023-11-19 07:54:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-19 07:54:58,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2023-11-19 07:54:58,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-19 07:54:58,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-19 07:54:58,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:58,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-19 07:54:58,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-11-19 07:54:58,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:58,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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) [2023-11-19 07:54:58,692 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 217 flow. Second operand 3 states and 352 transitions. [2023-11-19 07:54:58,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 245 flow [2023-11-19 07:54:58,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:58,697 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2023-11-19 07:54:58,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-19 07:54:58,698 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-11-19 07:54:58,698 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2023-11-19 07:54:58,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-11-19 07:54:58,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:58,698 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:54:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:54:58,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 07:54:58,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash 246945763, now seen corresponding path program 1 times [2023-11-19 07:54:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931610942] [2023-11-19 07:54:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:54:58,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:54:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:54:58,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:54:58,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:54:58,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-19 07:54:58,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-11-19 07:54:58,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 07:54:58,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2023-11-19 07:54:58,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 13 remaining) [2023-11-19 07:54:58,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 07:54:58,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 07:54:58,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 13 remaining) [2023-11-19 07:54:58,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-11-19 07:54:58,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2023-11-19 07:54:58,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 13 remaining) [2023-11-19 07:54:58,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2023-11-19 07:54:58,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 13 remaining) [2023-11-19 07:54:58,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:54:58,738 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:58,739 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:54:58,739 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 07:54:58,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:54:58,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,813 INFO L124 PetriNetUnfolderBase]: 20/225 cut-off events. [2023-11-19 07:54:58,814 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:54:58,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 225 events. 20/225 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 667 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 172. Up to 8 conditions per place. [2023-11-19 07:54:58,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,819 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:54:58,819 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,819 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 170 transitions, 358 flow [2023-11-19 07:54:58,846 INFO L124 PetriNetUnfolderBase]: 20/225 cut-off events. [2023-11-19 07:54:58,846 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:54:58,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 225 events. 20/225 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 667 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 172. Up to 8 conditions per place. [2023-11-19 07:54:58,858 INFO L119 LiptonReduction]: Number of co-enabled transitions 12876 [2023-11-19 07:55:03,850 INFO L134 LiptonReduction]: Checked pairs total: 28091 [2023-11-19 07:55:03,850 INFO L136 LiptonReduction]: Total number of compositions: 176 [2023-11-19 07:55:03,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:55:03,852 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4fc3d901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:55:03,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:55:03,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:55:03,854 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:55:03,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:55:03,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:03,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:55:03,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:03,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 34649, now seen corresponding path program 1 times [2023-11-19 07:55:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138193179] [2023-11-19 07:55:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:03,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138193179] [2023-11-19 07:55:03,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138193179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:03,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:03,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:55:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732543944] [2023-11-19 07:55:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:03,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:03,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 346 [2023-11-19 07:55:03,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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) [2023-11-19 07:55:03,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:03,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 346 [2023-11-19 07:55:03,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:05,278 INFO L124 PetriNetUnfolderBase]: 7738/10978 cut-off events. [2023-11-19 07:55:05,278 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2023-11-19 07:55:05,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20949 conditions, 10978 events. 7738/10978 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 67162 event pairs, 4912 based on Foata normal form. 0/4697 useless extension candidates. Maximal degree in co-relation 1629. Up to 9652 conditions per place. [2023-11-19 07:55:05,391 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 29 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-19 07:55:05,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 168 flow [2023-11-19 07:55:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-11-19 07:55:05,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4508670520231214 [2023-11-19 07:55:05,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-11-19 07:55:05,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-11-19 07:55:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:05,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-11-19 07:55:05,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2023-11-19 07:55:05,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:05,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:05,403 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 114 flow. Second operand 3 states and 468 transitions. [2023-11-19 07:55:05,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 168 flow [2023-11-19 07:55:05,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 166 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:55:05,406 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 108 flow [2023-11-19 07:55:05,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-11-19 07:55:05,407 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-11-19 07:55:05,407 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 108 flow [2023-11-19 07:55:05,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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) [2023-11-19 07:55:05,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:05,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:55:05,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:55:05,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:05,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 34650, now seen corresponding path program 1 times [2023-11-19 07:55:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:05,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473948557] [2023-11-19 07:55:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473948557] [2023-11-19 07:55:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473948557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:05,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:55:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513695228] [2023-11-19 07:55:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:05,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 346 [2023-11-19 07:55:05,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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) [2023-11-19 07:55:05,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:05,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 346 [2023-11-19 07:55:05,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:06,526 INFO L124 PetriNetUnfolderBase]: 4943/7181 cut-off events. [2023-11-19 07:55:06,526 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-19 07:55:06,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13649 conditions, 7181 events. 4943/7181 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 42713 event pairs, 3059 based on Foata normal form. 0/3452 useless extension candidates. Maximal degree in co-relation 13640. Up to 6219 conditions per place. [2023-11-19 07:55:06,585 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 28 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-19 07:55:06,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 164 flow [2023-11-19 07:55:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-11-19 07:55:06,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4508670520231214 [2023-11-19 07:55:06,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-11-19 07:55:06,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-11-19 07:55:06,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:06,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-11-19 07:55:06,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2023-11-19 07:55:06,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:06,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:06,595 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 108 flow. Second operand 3 states and 468 transitions. [2023-11-19 07:55:06,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 164 flow [2023-11-19 07:55:06,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:06,598 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 107 flow [2023-11-19 07:55:06,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-11-19 07:55:06,600 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-11-19 07:55:06,600 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 107 flow [2023-11-19 07:55:06,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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) [2023-11-19 07:55:06,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:06,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:06,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:55:06,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:06,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash 652302290, now seen corresponding path program 1 times [2023-11-19 07:55:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845037170] [2023-11-19 07:55:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:06,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:06,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:06,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845037170] [2023-11-19 07:55:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845037170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544614631] [2023-11-19 07:55:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:06,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:06,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 346 [2023-11-19 07:55:06,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-11-19 07:55:06,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:06,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 346 [2023-11-19 07:55:06,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:08,009 INFO L124 PetriNetUnfolderBase]: 6831/9698 cut-off events. [2023-11-19 07:55:08,010 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2023-11-19 07:55:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18731 conditions, 9698 events. 6831/9698 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 60811 event pairs, 2757 based on Foata normal form. 0/4818 useless extension candidates. Maximal degree in co-relation 18721. Up to 5606 conditions per place. [2023-11-19 07:55:08,195 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-19 07:55:08,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 259 flow [2023-11-19 07:55:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-11-19 07:55:08,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749518304431599 [2023-11-19 07:55:08,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-11-19 07:55:08,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-11-19 07:55:08,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:08,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-11-19 07:55:08,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2023-11-19 07:55:08,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:08,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:08,205 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 107 flow. Second operand 3 states and 493 transitions. [2023-11-19 07:55:08,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 259 flow [2023-11-19 07:55:08,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:08,209 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 120 flow [2023-11-19 07:55:08,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-19 07:55:08,210 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-11-19 07:55:08,210 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 120 flow [2023-11-19 07:55:08,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-11-19 07:55:08,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:08,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:08,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:55:08,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:08,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2026517173, now seen corresponding path program 1 times [2023-11-19 07:55:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:08,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619051668] [2023-11-19 07:55:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619051668] [2023-11-19 07:55:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619051668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:55:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064367229] [2023-11-19 07:55:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:08,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:55:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:55:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:55:08,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 346 [2023-11-19 07:55:08,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 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) [2023-11-19 07:55:08,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:08,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 346 [2023-11-19 07:55:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:11,114 INFO L124 PetriNetUnfolderBase]: 13787/19141 cut-off events. [2023-11-19 07:55:11,115 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2023-11-19 07:55:11,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40086 conditions, 19141 events. 13787/19141 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 122167 event pairs, 1459 based on Foata normal form. 0/10466 useless extension candidates. Maximal degree in co-relation 40075. Up to 8451 conditions per place. [2023-11-19 07:55:11,280 INFO L140 encePairwiseOnDemand]: 333/346 looper letters, 118 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2023-11-19 07:55:11,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 142 transitions, 639 flow [2023-11-19 07:55:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:55:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:55:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2023-11-19 07:55:11,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421965317919075 [2023-11-19 07:55:11,285 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2023-11-19 07:55:11,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2023-11-19 07:55:11,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:11,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2023-11-19 07:55:11,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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) [2023-11-19 07:55:11,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 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) [2023-11-19 07:55:11,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 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) [2023-11-19 07:55:11,297 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 120 flow. Second operand 6 states and 918 transitions. [2023-11-19 07:55:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 142 transitions, 639 flow [2023-11-19 07:55:11,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 142 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:55:11,313 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 230 flow [2023-11-19 07:55:11,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2023-11-19 07:55:11,315 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2023-11-19 07:55:11,315 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 230 flow [2023-11-19 07:55:11,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 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) [2023-11-19 07:55:11,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:11,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:55:11,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:11,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2026517172, now seen corresponding path program 1 times [2023-11-19 07:55:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777823942] [2023-11-19 07:55:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:11,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777823942] [2023-11-19 07:55:11,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777823942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:55:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485261699] [2023-11-19 07:55:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:11,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:11,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 346 [2023-11-19 07:55:11,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-11-19 07:55:11,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:11,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 346 [2023-11-19 07:55:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:12,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,270 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,270 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,270 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,270 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,307 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,308 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,308 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,308 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,310 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,310 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,310 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,311 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,311 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,311 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 85#L1042true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,328 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,329 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,418 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,419 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,419 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,419 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,453 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,454 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,454 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,454 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,465 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 85#L1042true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,465 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,465 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,465 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,466 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,466 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,542 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,543 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,543 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,543 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:55:12,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,546 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-11-19 07:55:12,546 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-19 07:55:12,546 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:12,546 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:12,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,547 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,547 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,547 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,547 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 131#thrEXITtrue, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,564 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,564 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,564 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,564 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 64#L1042true, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,602 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,602 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,602 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,602 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,627 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,627 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,627 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,627 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,628 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,629 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,629 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,629 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,629 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,629 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 85#L1042true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,642 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,642 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,642 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,642 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,658 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,658 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,658 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:12,658 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,658 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,658 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:12,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,659 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,659 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,659 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,659 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,660 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,661 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,661 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,661 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,667 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 07:55:12,667 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:12,667 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:12,668 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:12,673 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 131#thrEXITtrue, 38#L1041-2true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,673 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,673 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,673 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,673 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,673 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,675 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,675 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,675 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,675 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,676 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,676 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,676 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,676 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,700 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,700 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,700 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,700 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,722 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,722 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,722 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,722 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,722 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,722 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,733 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 85#L1042true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,734 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,734 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,734 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,734 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:12,734 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,966 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,966 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:12,966 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:12,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 131#thrEXITtrue, 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:12,987 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,987 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:12,987 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:12,987 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,116 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,117 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,117 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:13,117 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,117 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:13,117 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,119 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,119 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,119 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:13,119 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,119 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,120 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:13,126 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,126 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,126 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,126 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,126 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,126 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,127 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,127 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,127 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,127 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,128 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,128 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,155 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,155 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-19 07:55:13,156 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:13,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,156 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:13,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,157 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,158 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,158 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,159 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,159 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,160 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,160 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,177 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 131#thrEXITtrue, 38#L1041-2true, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,178 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,178 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,178 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,178 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,178 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,181 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,181 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,181 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,181 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,182 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,182 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,182 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,183 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,227 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,227 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,227 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,227 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,228 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,228 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,229 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 61#L1060-3true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,229 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,229 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:13,230 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:13,230 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,230 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,233 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 105#thrEXITtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,233 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,233 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,233 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,233 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,233 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,234 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][37], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 4#thrErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 176#true, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:13,235 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,235 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:13,235 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,235 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,235 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:13,235 INFO L124 PetriNetUnfolderBase]: 7770/11847 cut-off events. [2023-11-19 07:55:13,236 INFO L125 PetriNetUnfolderBase]: For 10054/10667 co-relation queries the response was YES. [2023-11-19 07:55:13,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29465 conditions, 11847 events. 7770/11847 cut-off events. For 10054/10667 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 86198 event pairs, 4519 based on Foata normal form. 113/9105 useless extension candidates. Maximal degree in co-relation 29449. Up to 9580 conditions per place. [2023-11-19 07:55:13,345 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 30 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-19 07:55:13,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 284 flow [2023-11-19 07:55:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-19 07:55:13,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441233140655106 [2023-11-19 07:55:13,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-19 07:55:13,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-19 07:55:13,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:13,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-19 07:55:13,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2023-11-19 07:55:13,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:13,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:13,353 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 230 flow. Second operand 3 states and 458 transitions. [2023-11-19 07:55:13,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 284 flow [2023-11-19 07:55:13,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:13,369 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 219 flow [2023-11-19 07:55:13,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-19 07:55:13,370 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-11-19 07:55:13,370 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 219 flow [2023-11-19 07:55:13,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-11-19 07:55:13,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:13,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:55:13,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:13,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2026517201, now seen corresponding path program 1 times [2023-11-19 07:55:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076931264] [2023-11-19 07:55:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076931264] [2023-11-19 07:55:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076931264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467333863] [2023-11-19 07:55:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:13,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:13,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 346 [2023-11-19 07:55:13,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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) [2023-11-19 07:55:13,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:13,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 346 [2023-11-19 07:55:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:15,169 INFO L124 PetriNetUnfolderBase]: 10632/14822 cut-off events. [2023-11-19 07:55:15,169 INFO L125 PetriNetUnfolderBase]: For 11337/11477 co-relation queries the response was YES. [2023-11-19 07:55:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38746 conditions, 14822 events. 10632/14822 cut-off events. For 11337/11477 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 91021 event pairs, 1345 based on Foata normal form. 226/11626 useless extension candidates. Maximal degree in co-relation 38729. Up to 6400 conditions per place. [2023-11-19 07:55:15,281 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 92 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2023-11-19 07:55:15,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 648 flow [2023-11-19 07:55:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:55:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:55:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 801 transitions. [2023-11-19 07:55:15,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630057803468208 [2023-11-19 07:55:15,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 801 transitions. [2023-11-19 07:55:15,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 801 transitions. [2023-11-19 07:55:15,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:15,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 801 transitions. [2023-11-19 07:55:15,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.2) internal successors, (801), 5 states have internal predecessors, (801), 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) [2023-11-19 07:55:15,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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) [2023-11-19 07:55:15,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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) [2023-11-19 07:55:15,295 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 219 flow. Second operand 5 states and 801 transitions. [2023-11-19 07:55:15,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 648 flow [2023-11-19 07:55:15,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:15,342 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 283 flow [2023-11-19 07:55:15,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2023-11-19 07:55:15,343 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-11-19 07:55:15,343 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 283 flow [2023-11-19 07:55:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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) [2023-11-19 07:55:15,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:15,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:15,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:55:15,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:15,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1279951427, now seen corresponding path program 1 times [2023-11-19 07:55:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743713068] [2023-11-19 07:55:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:55:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743713068] [2023-11-19 07:55:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743713068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862060623] [2023-11-19 07:55:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:15,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 346 [2023-11-19 07:55:15,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-11-19 07:55:15,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:15,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 346 [2023-11-19 07:55:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:16,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,117 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:55:16,118 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:55:16,118 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:55:16,118 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:55:16,119 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,119 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,119 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,119 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,119 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,119 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,130 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:55:16,130 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:55:16,130 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:55:16,130 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:55:16,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,171 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,171 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,171 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,171 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 64#L1042true, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,173 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,173 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, 75#L1040-1true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,416 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,416 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,416 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,416 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, 75#L1040-1true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,461 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,461 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,461 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:55:16,461 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,660 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-11-19 07:55:16,660 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,660 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-19 07:55:16,660 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,661 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,661 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,661 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,661 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,663 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,663 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,663 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,664 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,673 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,673 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,673 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,673 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,673 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,673 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:16,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 76#L1041-2true, 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,717 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,717 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,718 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,718 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,755 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,755 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:16,756 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,756 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:16,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,758 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:16,758 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,758 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,758 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,758 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,768 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,768 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,768 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:16,768 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:16,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,956 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:16,956 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,956 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,956 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:16,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,958 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:16,958 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,958 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:16,958 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,986 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,986 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 07:55:16,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,987 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,987 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:55:16,987 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:16,987 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:16,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 76#L1041-2true, 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:16,999 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,999 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 07:55:16,999 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:16,999 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-19 07:55:17,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 7#thrEXITtrue, 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,013 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,013 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,013 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,014 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [75#L1040-1true, 130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,035 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,035 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, 75#L1040-1true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,066 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,066 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,066 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,066 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:17,107 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,107 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,107 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,108 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,108 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,108 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,108 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,109 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,109 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:17,109 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:17,109 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:55:17,109 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:17,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 7#thrEXITtrue, 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,123 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,123 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:55:17,123 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,123 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 112#L1040-1true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,149 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2023-11-19 07:55:17,149 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-19 07:55:17,149 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-19 07:55:17,150 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-19 07:55:17,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 64#L1042true, 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,150 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,150 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,150 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,151 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,151 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,151 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,152 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,152 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,160 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,160 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,160 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,160 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,160 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,161 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 76#L1041-2true, 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,196 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,196 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,196 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][75], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L1046-2true, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,233 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,233 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,233 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,233 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 106#L1042true, 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,250 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,250 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 76#L1041-2true, 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,262 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2023-11-19 07:55:17,262 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:55:17,262 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:55:17,262 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-19 07:55:17,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 7#thrEXITtrue, 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,282 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,283 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,283 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,283 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,296 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,297 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,297 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,297 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,297 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,297 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,297 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 07:55:17,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][75], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 63#L1060-4true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L1046-2true, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,298 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,298 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,298 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,299 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,334 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,335 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,335 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,335 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,335 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,335 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,336 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,336 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,337 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,337 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,337 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:55:17,337 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][74], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), 61#L1060-3true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 7#thrEXITtrue, 206#(and (= |thrThread2of3ForFork0_~c~0#1| 0) (= |thrThread2of3ForFork0_~end~0#1| 0)), 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,449 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,449 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:55:17,449 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,449 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][75], [thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), 102#L1043true, Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 21#L1046-2true, 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,491 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,491 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,491 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,491 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,500 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1051] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|) (not (= 0 (ite (and (< |v_thrThread2of3ForFork0_~c~0#1_67| v_~len~0_244) (<= 0 |v_thrThread2of3ForFork0_~c~0#1_67|)) 1 0))) (= |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44| |v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|) (< |v_thrThread2of3ForFork0_~c~0#1_67| |v_thrThread2of3ForFork0_~end~0#1_47|) (let ((.cse0 (* |v_thrThread2of3ForFork0_~c~0#1_67| 4))) (or (< (+ v_~data~0.offset_121 .cse0) 0) (< (select |v_#length_280| v_~data~0.base_142) (+ v_~data~0.offset_121 4 .cse0))))) InVars {~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_44|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_44|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_142, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_47|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset_43|, ~len~0=v_~len~0_244, ~data~0.offset=v_~data~0.offset_121, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_67|, #length=|v_#length_280|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_43|, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of3ForFork0_reach_error_#t~nondet3#1.base_43|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_reach_error_#t~nondet3#1.base][55], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 38#L1041-2true, 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 103#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,500 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 07:55:17,500 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L1046-2-->thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (* |v_thrThread3of3ForFork0_~c~0#1_57| 4))) (or (< (select |v_#length_286| v_~data~0.base_148) (+ v_~data~0.offset_127 .cse0 4)) (< (+ v_~data~0.offset_127 .cse0) 0))) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|) (not (= (ite (and (<= 0 |v_thrThread3of3ForFork0_~c~0#1_57|) (< |v_thrThread3of3ForFork0_~c~0#1_57| v_~len~0_250)) 1 0) 0)) (< |v_thrThread3of3ForFork0_~c~0#1_57| |v_thrThread3of3ForFork0_~end~0#1_41|) (= |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39| |v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|)) InVars {~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_40|, ~data~0.offset=v_~data~0.offset_127, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_40|} OutVars{thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_51|, ~data~0.base=v_~data~0.base_148, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_57|, ~len~0=v_~len~0_250, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_41|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset_39|, ~data~0.offset=v_~data~0.offset_127, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_33|, #length=|v_#length_286|, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread3of3ForFork0_reach_error_#t~nondet3#1.base_39|} AuxVars[] AssignedVars[thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_reach_error_#t~nondet3#1.base][75], [130#L1041-2true, thrThread3of3ForFork0InUse, 193#(= (select |#valid| ~data~0.base) 1), Black: 198#(and (= |thrThread1of3ForFork0_~c~0#1| 0) (<= 1 ~len~0)), Black: 197#(and (= ~next~0 0) (<= 1 ~len~0)), 52#thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 173#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 61#L1060-3true, 195#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 21#L1046-2true, 169#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 183#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), Black: 185#(and (= ~data~0.offset 0) (= ~next~0 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), thrThread1of3ForFork0InUse, Black: 181#(and (= ~data~0.offset 0) (<= 40 (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (= |thrThread1of3ForFork0_~c~0#1| 0) (<= (div ~len~0 1073741824) 0)), Black: 178#(and (= ~data~0.offset 0) (= ~next~0 0) (<= (* ~len~0 4) (+ (select |#length| ~data~0.base) (* (div ~len~0 1073741824) 4294967296))) (<= (div ~len~0 1073741824) 0)), 204#true, thrThread2of3ForFork0InUse]) [2023-11-19 07:55:17,501 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:55:17,520 INFO L124 PetriNetUnfolderBase]: 10947/16377 cut-off events. [2023-11-19 07:55:17,520 INFO L125 PetriNetUnfolderBase]: For 17460/18458 co-relation queries the response was YES. [2023-11-19 07:55:17,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42337 conditions, 16377 events. 10947/16377 cut-off events. For 17460/18458 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 117896 event pairs, 4021 based on Foata normal form. 540/13217 useless extension candidates. Maximal degree in co-relation 42317. Up to 9068 conditions per place. [2023-11-19 07:55:17,652 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 54 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-11-19 07:55:17,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 500 flow [2023-11-19 07:55:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-11-19 07:55:17,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682080924855491 [2023-11-19 07:55:17,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-11-19 07:55:17,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-11-19 07:55:17,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:17,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-11-19 07:55:17,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) [2023-11-19 07:55:17,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:17,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 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) [2023-11-19 07:55:17,662 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 283 flow. Second operand 3 states and 486 transitions. [2023-11-19 07:55:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 500 flow [2023-11-19 07:55:17,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:17,687 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 289 flow [2023-11-19 07:55:17,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-11-19 07:55:17,689 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-11-19 07:55:17,689 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 289 flow [2023-11-19 07:55:17,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-11-19 07:55:17,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:17,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:17,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:55:17,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:17,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1602478170, now seen corresponding path program 1 times [2023-11-19 07:55:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172307970] [2023-11-19 07:55:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:17,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172307970] [2023-11-19 07:55:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172307970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:55:17,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071110277] [2023-11-19 07:55:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:17,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:55:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:17,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:55:17,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:55:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:18,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:55:18,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:55:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:18,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:55:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071110277] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:55:18,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:55:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-19 07:55:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921334988] [2023-11-19 07:55:18,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:55:18,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:55:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:55:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:55:18,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 346 [2023-11-19 07:55:18,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 289 flow. Second operand has 12 states, 12 states have (on average 136.91666666666666) internal successors, (1643), 12 states have internal predecessors, (1643), 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) [2023-11-19 07:55:18,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:18,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 346 [2023-11-19 07:55:18,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:22,912 INFO L124 PetriNetUnfolderBase]: 21319/31265 cut-off events. [2023-11-19 07:55:22,912 INFO L125 PetriNetUnfolderBase]: For 37246/37684 co-relation queries the response was YES. [2023-11-19 07:55:22,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90006 conditions, 31265 events. 21319/31265 cut-off events. For 37246/37684 co-relation queries the response was YES. Maximal size of possible extension queue 1972. Compared 233207 event pairs, 1467 based on Foata normal form. 1222/26825 useless extension candidates. Maximal degree in co-relation 89985. Up to 6784 conditions per place. [2023-11-19 07:55:23,203 INFO L140 encePairwiseOnDemand]: 331/346 looper letters, 315 selfloop transitions, 70 changer transitions 0/396 dead transitions. [2023-11-19 07:55:23,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 396 transitions, 2508 flow [2023-11-19 07:55:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 07:55:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-19 07:55:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3109 transitions. [2023-11-19 07:55:23,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492774566473988 [2023-11-19 07:55:23,215 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3109 transitions. [2023-11-19 07:55:23,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3109 transitions. [2023-11-19 07:55:23,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:23,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3109 transitions. [2023-11-19 07:55:23,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 155.45) internal successors, (3109), 20 states have internal predecessors, (3109), 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) [2023-11-19 07:55:23,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 346.0) internal successors, (7266), 21 states have internal predecessors, (7266), 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) [2023-11-19 07:55:23,248 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 346.0) internal successors, (7266), 21 states have internal predecessors, (7266), 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) [2023-11-19 07:55:23,249 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 289 flow. Second operand 20 states and 3109 transitions. [2023-11-19 07:55:23,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 396 transitions, 2508 flow [2023-11-19 07:55:23,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 396 transitions, 2470 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:55:23,413 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 1014 flow [2023-11-19 07:55:23,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1014, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2023-11-19 07:55:23,414 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places. [2023-11-19 07:55:23,415 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 1014 flow [2023-11-19 07:55:23,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 136.91666666666666) internal successors, (1643), 12 states have internal predecessors, (1643), 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) [2023-11-19 07:55:23,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:23,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:23,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:55:23,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:55:23,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 07:55:23,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1602478198, now seen corresponding path program 1 times [2023-11-19 07:55:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596894551] [2023-11-19 07:55:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596894551] [2023-11-19 07:55:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596894551] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:55:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064575599] [2023-11-19 07:55:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:55:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:24,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:55:24,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc78b41c-7f86-4325-8b22-bb2c2ae3b0bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:55:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:24,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-19 07:55:24,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:55:24,206 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 [2023-11-19 07:55:24,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:55:24,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:55:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:24,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:55:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064575599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:55:24,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:55:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-11-19 07:55:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781466849] [2023-11-19 07:55:24,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:55:24,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:55:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:55:24,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:55:26,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 346 [2023-11-19 07:55:26,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 1014 flow. Second operand has 15 states, 15 states have (on average 128.86666666666667) internal successors, (1933), 15 states have internal predecessors, (1933), 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) [2023-11-19 07:55:26,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:26,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 346 [2023-11-19 07:55:26,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand