./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 07:00:21,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 07:00:21,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 07:00:21,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 07:00:21,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 07:00:21,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 07:00:21,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 07:00:21,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 07:00:21,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 07:00:21,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 07:00:21,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 07:00:21,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 07:00:21,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 07:00:21,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 07:00:21,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 07:00:21,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 07:00:21,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 07:00:21,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 07:00:21,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 07:00:21,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 07:00:21,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 07:00:21,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 07:00:21,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 07:00:21,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 07:00:21,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 07:00:21,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 07:00:21,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 07:00:21,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 07:00:21,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 07:00:21,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 07:00:21,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 07:00:21,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 07:00:21,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 07:00:21,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 07:00:21,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 07:00:21,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 07:00:21,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 07:00:21,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 07:00:21,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 07:00:21,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 07:00:21,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 07:00:21,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 07:00:21,164 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 07:00:21,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 07:00:21,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 07:00:21,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 07:00:21,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 07:00:21,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 07:00:21,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 07:00:21,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 07:00:21,165 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 07:00:21,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 07:00:21,166 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 07:00:21,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 07:00:21,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 07:00:21,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 07:00:21,168 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 07:00:21,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 07:00:21,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 07:00:21,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 07:00:21,548 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 07:00:21,549 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 07:00:21,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 07:00:22,837 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 07:00:22,990 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 07:00:22,990 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 07:00:22,999 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfb6ee0f/40732ec263704f4abf34e52af87dcce7/FLAGe34c833ca [2023-08-30 07:00:23,020 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfb6ee0f/40732ec263704f4abf34e52af87dcce7 [2023-08-30 07:00:23,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 07:00:23,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 07:00:23,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 07:00:23,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 07:00:23,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 07:00:23,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:00:23" (1/1) ... [2023-08-30 07:00:23,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9846152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:23, skipping insertion in model container [2023-08-30 07:00:23,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:00:23" (1/1) ... [2023-08-30 07:00:23,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 07:00:23,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 07:00:23,224 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 07:00:23,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 07:00:23,248 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-08-30 07:00:23,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1bbdb6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:23, skipping insertion in model container [2023-08-30 07:00:23,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 07:00:23,250 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-08-30 07:00:23,252 INFO L158 Benchmark]: Toolchain (without parser) took 227.52ms. Allocated memory is still 77.6MB. Free memory was 51.2MB in the beginning and 41.6MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 07:00:23,253 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 07:00:23,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 41.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 07:00:23,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 41.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 99]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 07:00:24,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 07:00:24,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 07:00:25,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 07:00:25,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 07:00:25,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 07:00:25,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 07:00:25,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 07:00:25,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 07:00:25,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 07:00:25,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 07:00:25,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 07:00:25,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 07:00:25,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 07:00:25,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 07:00:25,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 07:00:25,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 07:00:25,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 07:00:25,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 07:00:25,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 07:00:25,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 07:00:25,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 07:00:25,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 07:00:25,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 07:00:25,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 07:00:25,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 07:00:25,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 07:00:25,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 07:00:25,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 07:00:25,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 07:00:25,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 07:00:25,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 07:00:25,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 07:00:25,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 07:00:25,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 07:00:25,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 07:00:25,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 07:00:25,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 07:00:25,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 07:00:25,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 07:00:25,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 07:00:25,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 07:00:25,131 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 07:00:25,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 07:00:25,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 07:00:25,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 07:00:25,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 07:00:25,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 07:00:25,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 07:00:25,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 07:00:25,134 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 07:00:25,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 07:00:25,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 07:00:25,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 07:00:25,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 07:00:25,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 07:00:25,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 07:00:25,136 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 07:00:25,136 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 07:00:25,137 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 07:00:25,138 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 07:00:25,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 07:00:25,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 07:00:25,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 07:00:25,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 07:00:25,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 07:00:25,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 07:00:25,139 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 07:00:25,139 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 07:00:25,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 07:00:25,140 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 07:00:25,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 07:00:25,140 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 07:00:25,140 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 07:00:25,141 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 07:00:25,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 07:00:25,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 07:00:25,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 07:00:25,457 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 07:00:25,458 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 07:00:25,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 07:00:26,580 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 07:00:26,780 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 07:00:26,780 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 07:00:26,787 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491410379/0465bf3434e54a1fb3868bf19e21af2d/FLAG1158c6c2c [2023-08-30 07:00:26,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491410379/0465bf3434e54a1fb3868bf19e21af2d [2023-08-30 07:00:26,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 07:00:26,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 07:00:26,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 07:00:26,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 07:00:26,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 07:00:26,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:00:26" (1/1) ... [2023-08-30 07:00:26,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1f1338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:26, skipping insertion in model container [2023-08-30 07:00:26,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:00:26" (1/1) ... [2023-08-30 07:00:26,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 07:00:26,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 07:00:26,962 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 07:00:26,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 07:00:26,981 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-30 07:00:26,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 07:00:27,000 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 07:00:27,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 07:00:27,012 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 07:00:27,035 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 07:00:27,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 07:00:27,069 INFO L208 MainTranslator]: Completed translation [2023-08-30 07:00:27,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27 WrapperNode [2023-08-30 07:00:27,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 07:00:27,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 07:00:27,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 07:00:27,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 07:00:27,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,126 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-08-30 07:00:27,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 07:00:27,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 07:00:27,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 07:00:27,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 07:00:27,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 07:00:27,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 07:00:27,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 07:00:27,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 07:00:27,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (1/1) ... [2023-08-30 07:00:27,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 07:00:27,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 07:00:27,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 07:00:27,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 07:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 07:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 07:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 07:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 07:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 07:00:27,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 07:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 07:00:27,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 07:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 07:00:27,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 07:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 07:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 07:00:27,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 07:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 07:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 07:00:27,258 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 07:00:27,474 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 07:00:27,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 07:00:27,794 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 07:00:27,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 07:00:27,803 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 07:00:27,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:00:27 BoogieIcfgContainer [2023-08-30 07:00:27,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 07:00:27,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 07:00:27,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 07:00:27,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 07:00:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 07:00:26" (1/3) ... [2023-08-30 07:00:27,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3825d74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:00:27, skipping insertion in model container [2023-08-30 07:00:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:00:27" (2/3) ... [2023-08-30 07:00:27,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3825d74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:00:27, skipping insertion in model container [2023-08-30 07:00:27,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:00:27" (3/3) ... [2023-08-30 07:00:27,812 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-08-30 07:00:27,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 07:00:27,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-08-30 07:00:27,827 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 07:00:27,969 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 07:00:27,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 172 transitions, 368 flow [2023-08-30 07:00:28,050 INFO L130 PetriNetUnfolder]: 12/169 cut-off events. [2023-08-30 07:00:28,050 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 07:00:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 12/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 197 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 07:00:28,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 172 transitions, 368 flow [2023-08-30 07:00:28,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 165 transitions, 348 flow [2023-08-30 07:00:28,067 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 07:00:28,078 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 165 transitions, 348 flow [2023-08-30 07:00:28,080 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 165 transitions, 348 flow [2023-08-30 07:00:28,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 348 flow [2023-08-30 07:00:28,113 INFO L130 PetriNetUnfolder]: 12/165 cut-off events. [2023-08-30 07:00:28,113 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 07:00:28,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 165 events. 12/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 07:00:28,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-08-30 07:00:41,667 INFO L134 LiptonReduction]: Checked pairs total: 3177 [2023-08-30 07:00:41,667 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-30 07:00:41,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 07:00:41,682 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;@6d1d16e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 07:00:41,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-30 07:00:41,685 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 07:00:41,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 07:00:41,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:41,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 07:00:41,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:41,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 20235, now seen corresponding path program 1 times [2023-08-30 07:00:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722067861] [2023-08-30 07:00:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:41,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:41,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 07:00:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:41,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 07:00:41,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:41,949 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-30 07:00:41,950 INFO L350 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 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-30 07:00:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:41,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:41,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722067861] [2023-08-30 07:00:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722067861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059912794] [2023-08-30 07:00:41,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:41,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:42,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 07:00:42,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:42,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:42,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 07:00:42,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:42,690 INFO L130 PetriNetUnfolder]: 2765/3512 cut-off events. [2023-08-30 07:00:42,691 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-30 07:00:42,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7096 conditions, 3512 events. 2765/3512 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 14361 event pairs, 1310 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 6096. Up to 3486 conditions per place. [2023-08-30 07:00:42,717 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 07:00:42,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 184 flow [2023-08-30 07:00:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-30 07:00:42,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2023-08-30 07:00:42,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-30 07:00:42,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-30 07:00:42,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:42,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-30 07:00:42,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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-08-30 07:00:42,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:42,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:42,759 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 108 flow. Second operand 3 states and 492 transitions. [2023-08-30 07:00:42,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 184 flow [2023-08-30 07:00:42,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 07:00:42,769 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-30 07:00:42,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-30 07:00:42,775 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 07:00:42,776 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-30 07:00:42,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:42,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:42,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 07:00:42,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:42,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:42,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:42,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash 20283, now seen corresponding path program 1 times [2023-08-30 07:00:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368224453] [2023-08-30 07:00:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:43,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:43,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 07:00:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:43,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 07:00:43,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:43,160 INFO L321 Elim1Store]: treesize reduction 111, result has 19.0 percent of original size [2023-08-30 07:00:43,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 51 [2023-08-30 07:00:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:43,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:43,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368224453] [2023-08-30 07:00:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368224453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:43,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:43,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092359078] [2023-08-30 07:00:43,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:43,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:43,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 07:00:43,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:43,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:43,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 07:00:43,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:43,767 INFO L130 PetriNetUnfolder]: 2185/2806 cut-off events. [2023-08-30 07:00:43,767 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 07:00:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 2806 events. 2185/2806 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 11317 event pairs, 1030 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 5615. Up to 2780 conditions per place. [2023-08-30 07:00:43,781 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 07:00:43,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 166 flow [2023-08-30 07:00:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-08-30 07:00:43,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904904904904905 [2023-08-30 07:00:43,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-08-30 07:00:43,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-08-30 07:00:43,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:43,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-08-30 07:00:43,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-08-30 07:00:43,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:43,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:43,790 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 490 transitions. [2023-08-30 07:00:43,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 166 flow [2023-08-30 07:00:43,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:43,792 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 91 flow [2023-08-30 07:00:43,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=91, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-30 07:00:43,793 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-30 07:00:43,794 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 91 flow [2023-08-30 07:00:43,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:43,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:43,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 07:00:43,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-30 07:00:44,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:44,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:44,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash 20284, now seen corresponding path program 1 times [2023-08-30 07:00:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903762799] [2023-08-30 07:00:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:44,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:44,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 07:00:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:44,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 07:00:44,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:44,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:44,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:44,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:44,198 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 07:00:44,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 07:00:44,247 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-08-30 07:00:44,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 89 [2023-08-30 07:00:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:44,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:44,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903762799] [2023-08-30 07:00:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903762799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61804902] [2023-08-30 07:00:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:44,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 07:00:44,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-08-30 07:00:44,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:44,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 07:00:44,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:44,772 INFO L130 PetriNetUnfolder]: 1605/2100 cut-off events. [2023-08-30 07:00:44,772 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 07:00:44,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4210 conditions, 2100 events. 1605/2100 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 8419 event pairs, 750 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 4203. Up to 2074 conditions per place. [2023-08-30 07:00:44,782 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 35 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-30 07:00:44,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 159 flow [2023-08-30 07:00:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2023-08-30 07:00:44,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914914914914915 [2023-08-30 07:00:44,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2023-08-30 07:00:44,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2023-08-30 07:00:44,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:44,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2023-08-30 07:00:44,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-08-30 07:00:44,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:44,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:44,793 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 91 flow. Second operand 3 states and 491 transitions. [2023-08-30 07:00:44,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 159 flow [2023-08-30 07:00:44,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:44,794 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 88 flow [2023-08-30 07:00:44,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-30 07:00:44,796 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-08-30 07:00:44,796 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 88 flow [2023-08-30 07:00:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-08-30 07:00:44,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:44,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 07:00:44,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:45,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:45,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:45,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash 20236, now seen corresponding path program 1 times [2023-08-30 07:00:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650427352] [2023-08-30 07:00:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:45,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:45,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:45,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:45,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 07:00:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:45,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 07:00:45,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:45,156 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:00:45,156 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:00:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:45,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:45,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650427352] [2023-08-30 07:00:45,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650427352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:45,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:45,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:45,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680231786] [2023-08-30 07:00:45,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:45,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:45,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:45,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:45,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:45,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 07:00:45,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:45,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:45,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 07:00:45,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:45,873 INFO L130 PetriNetUnfolder]: 3161/4150 cut-off events. [2023-08-30 07:00:45,874 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 07:00:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4150 events. 3161/4150 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 18563 event pairs, 1491 based on Foata normal form. 0/1322 useless extension candidates. Maximal degree in co-relation 8303. Up to 2072 conditions per place. [2023-08-30 07:00:45,893 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 68 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-30 07:00:45,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 302 flow [2023-08-30 07:00:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-08-30 07:00:45,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215215215215215 [2023-08-30 07:00:45,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-08-30 07:00:45,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-08-30 07:00:45,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:45,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-08-30 07:00:45,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-08-30 07:00:45,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:45,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:45,900 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 88 flow. Second operand 3 states and 521 transitions. [2023-08-30 07:00:45,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 302 flow [2023-08-30 07:00:45,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:45,902 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 99 flow [2023-08-30 07:00:45,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-30 07:00:45,903 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 07:00:45,903 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 99 flow [2023-08-30 07:00:45,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 07:00:45,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:45,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 07:00:45,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:46,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:46,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:46,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 628487, now seen corresponding path program 1 times [2023-08-30 07:00:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:46,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346824663] [2023-08-30 07:00:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:46,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:46,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:46,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 07:00:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:46,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 07:00:46,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:46,265 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:00:46,266 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:00:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:46,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:00:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:46,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346824663] [2023-08-30 07:00:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346824663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:00:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:00:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-08-30 07:00:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138049087] [2023-08-30 07:00:46,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:00:46,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 07:00:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 07:00:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 07:00:47,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-08-30 07:00:47,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 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-08-30 07:00:47,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:47,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-08-30 07:00:47,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:47,978 INFO L130 PetriNetUnfolder]: 4719/6204 cut-off events. [2023-08-30 07:00:47,978 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 07:00:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12428 conditions, 6204 events. 4719/6204 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 29669 event pairs, 2232 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 12418. Up to 2072 conditions per place. [2023-08-30 07:00:48,032 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 101 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2023-08-30 07:00:48,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 111 transitions, 475 flow [2023-08-30 07:00:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 07:00:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 07:00:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2023-08-30 07:00:48,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-08-30 07:00:48,036 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 981 transitions. [2023-08-30 07:00:48,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 981 transitions. [2023-08-30 07:00:48,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:48,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 981 transitions. [2023-08-30 07:00:48,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 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-08-30 07:00:48,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 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-08-30 07:00:48,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 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-08-30 07:00:48,043 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 99 flow. Second operand 6 states and 981 transitions. [2023-08-30 07:00:48,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 111 transitions, 475 flow [2023-08-30 07:00:48,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:48,047 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 151 flow [2023-08-30 07:00:48,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 07:00:48,049 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-30 07:00:48,049 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 151 flow [2023-08-30 07:00:48,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 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-08-30 07:00:48,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:48,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 07:00:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:48,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:48,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 19507983, now seen corresponding path program 1 times [2023-08-30 07:00:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309637811] [2023-08-30 07:00:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:48,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:48,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 07:00:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:48,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 07:00:48,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:48,386 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 07:00:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 40 [2023-08-30 07:00:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:48,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:48,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309637811] [2023-08-30 07:00:48,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309637811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:48,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151063440] [2023-08-30 07:00:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:48,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:48,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 07:00:48,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-08-30 07:00:48,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:48,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 07:00:48,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:49,170 INFO L130 PetriNetUnfolder]: 4554/5949 cut-off events. [2023-08-30 07:00:49,171 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 07:00:49,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11953 conditions, 5949 events. 4554/5949 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 27996 event pairs, 2121 based on Foata normal form. 0/1890 useless extension candidates. Maximal degree in co-relation 11938. Up to 5871 conditions per place. [2023-08-30 07:00:49,197 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 07:00:49,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 227 flow [2023-08-30 07:00:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-30 07:00:49,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-08-30 07:00:49,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-30 07:00:49,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-30 07:00:49,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:49,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-30 07:00:49,202 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-08-30 07:00:49,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:49,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:49,204 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 151 flow. Second operand 3 states and 486 transitions. [2023-08-30 07:00:49,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 227 flow [2023-08-30 07:00:49,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 217 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:49,206 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 139 flow [2023-08-30 07:00:49,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-30 07:00:49,207 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-30 07:00:49,207 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 139 flow [2023-08-30 07:00:49,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-08-30 07:00:49,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:49,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 07:00:49,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:49,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:49,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:49,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash 19507984, now seen corresponding path program 1 times [2023-08-30 07:00:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264695842] [2023-08-30 07:00:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:49,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:49,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:49,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 07:00:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:49,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 07:00:49,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:49,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:49,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:49,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:00:49,583 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 07:00:49,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 07:00:49,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-08-30 07:00:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:49,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:49,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264695842] [2023-08-30 07:00:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264695842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:00:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367781524] [2023-08-30 07:00:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:49,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:00:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:00:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:00:49,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 07:00:49,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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-08-30 07:00:49,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:49,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 07:00:49,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:50,415 INFO L130 PetriNetUnfolder]: 4293/5598 cut-off events. [2023-08-30 07:00:50,416 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 07:00:50,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11248 conditions, 5598 events. 4293/5598 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 25873 event pairs, 1992 based on Foata normal form. 0/1824 useless extension candidates. Maximal degree in co-relation 11232. Up to 5520 conditions per place. [2023-08-30 07:00:50,440 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 07:00:50,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 211 flow [2023-08-30 07:00:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:00:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:00:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-30 07:00:50,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4874874874874875 [2023-08-30 07:00:50,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-30 07:00:50,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-30 07:00:50,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:50,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-30 07:00:50,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 07:00:50,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:50,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:00:50,447 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 139 flow. Second operand 3 states and 487 transitions. [2023-08-30 07:00:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 211 flow [2023-08-30 07:00:50,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:50,449 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 136 flow [2023-08-30 07:00:50,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=136, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 07:00:50,450 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-30 07:00:50,450 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 136 flow [2023-08-30 07:00:50,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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-08-30 07:00:50,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:50,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 07:00:50,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:50,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:50,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 604742081, now seen corresponding path program 1 times [2023-08-30 07:00:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481202345] [2023-08-30 07:00:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:50,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:50,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:50,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 07:00:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:50,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 07:00:50,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:50,799 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-30 07:00:50,799 INFO L350 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 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-30 07:00:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:50,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:50,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481202345] [2023-08-30 07:00:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481202345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 07:00:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230243893] [2023-08-30 07:00:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:50,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 07:00:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:50,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 07:00:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 07:00:50,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 07:00:50,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 136 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-08-30 07:00:50,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:50,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 07:00:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:51,338 INFO L130 PetriNetUnfolder]: 2229/2988 cut-off events. [2023-08-30 07:00:51,338 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 07:00:51,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 2988 events. 2229/2988 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13170 event pairs, 1014 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 6009. Up to 2930 conditions per place. [2023-08-30 07:00:51,348 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-30 07:00:51,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 200 flow [2023-08-30 07:00:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 07:00:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 07:00:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2023-08-30 07:00:51,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-30 07:00:51,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 600 transitions. [2023-08-30 07:00:51,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 600 transitions. [2023-08-30 07:00:51,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:51,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 600 transitions. [2023-08-30 07:00:51,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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-08-30 07:00:51,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 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-08-30 07:00:51,366 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 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-08-30 07:00:51,367 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 136 flow. Second operand 4 states and 600 transitions. [2023-08-30 07:00:51,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 200 flow [2023-08-30 07:00:51,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:00:51,369 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 137 flow [2023-08-30 07:00:51,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-30 07:00:51,370 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-30 07:00:51,371 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 137 flow [2023-08-30 07:00:51,371 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-08-30 07:00:51,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:51,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 07:00:51,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:51,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:51,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:51,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 604742082, now seen corresponding path program 1 times [2023-08-30 07:00:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636635032] [2023-08-30 07:00:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:51,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:51,582 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:51,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 07:00:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:51,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 07:00:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:51,742 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:00:51,743 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:00:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:51,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:51,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636635032] [2023-08-30 07:00:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636635032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 07:00:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030950118] [2023-08-30 07:00:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:51,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 07:00:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:51,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 07:00:51,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 07:00:52,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-08-30 07:00:52,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 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-08-30 07:00:52,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:52,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-08-30 07:00:52,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:52,531 INFO L130 PetriNetUnfolder]: 3213/4422 cut-off events. [2023-08-30 07:00:52,532 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2023-08-30 07:00:52,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8930 conditions, 4422 events. 3213/4422 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 21645 event pairs, 783 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 8912. Up to 2642 conditions per place. [2023-08-30 07:00:52,546 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 53 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-08-30 07:00:52,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 306 flow [2023-08-30 07:00:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 07:00:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 07:00:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2023-08-30 07:00:52,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678678678678679 [2023-08-30 07:00:52,551 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 779 transitions. [2023-08-30 07:00:52,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 779 transitions. [2023-08-30 07:00:52,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:52,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 779 transitions. [2023-08-30 07:00:52,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 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-08-30 07:00:52,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:00:52,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:00:52,556 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 137 flow. Second operand 5 states and 779 transitions. [2023-08-30 07:00:52,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 306 flow [2023-08-30 07:00:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 07:00:52,559 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 152 flow [2023-08-30 07:00:52,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-30 07:00:52,560 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-30 07:00:52,560 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 152 flow [2023-08-30 07:00:52,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 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-08-30 07:00:52,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:52,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 07:00:52,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:52,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:52,770 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:52,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1567139639, now seen corresponding path program 1 times [2023-08-30 07:00:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607738652] [2023-08-30 07:00:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:00:52,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:52,773 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:52,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 07:00:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:00:52,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 07:00:52,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:52,936 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:00:52,937 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:00:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:53,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:00:53,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607738652] [2023-08-30 07:00:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607738652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:00:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:00:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 07:00:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34923386] [2023-08-30 07:00:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:00:53,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 07:00:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:53,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 07:00:53,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 07:00:53,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 07:00:53,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 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-08-30 07:00:53,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:53,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 07:00:53,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:00:53,812 INFO L130 PetriNetUnfolder]: 2173/3114 cut-off events. [2023-08-30 07:00:53,812 INFO L131 PetriNetUnfolder]: For 566/566 co-relation queries the response was YES. [2023-08-30 07:00:53,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 3114 events. 2173/3114 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15710 event pairs, 1130 based on Foata normal form. 32/1738 useless extension candidates. Maximal degree in co-relation 6754. Up to 2757 conditions per place. [2023-08-30 07:00:53,822 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 67 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-30 07:00:53,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 380 flow [2023-08-30 07:00:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 07:00:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 07:00:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 780 transitions. [2023-08-30 07:00:53,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-30 07:00:53,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 780 transitions. [2023-08-30 07:00:53,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 780 transitions. [2023-08-30 07:00:53,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:00:53,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 780 transitions. [2023-08-30 07:00:53,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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-08-30 07:00:53,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:00:53,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:00:53,831 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 152 flow. Second operand 5 states and 780 transitions. [2023-08-30 07:00:53,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 380 flow [2023-08-30 07:00:53,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 367 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 07:00:53,833 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 181 flow [2023-08-30 07:00:53,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-30 07:00:53,834 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-30 07:00:53,834 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 181 flow [2023-08-30 07:00:53,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 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-08-30 07:00:53,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:00:53,835 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-30 07:00:53,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 07:00:54,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:54,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:00:54,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:00:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1544549836, now seen corresponding path program 2 times [2023-08-30 07:00:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:00:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483477038] [2023-08-30 07:00:54,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 07:00:54,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:00:54,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:00:54,046 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:00:54,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 07:00:54,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 07:00:54,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:00:54,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 07:00:54,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:00:54,225 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:00:54,225 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:00:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:54,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:00:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:00:54,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:00:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483477038] [2023-08-30 07:00:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483477038] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:00:54,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:00:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-08-30 07:00:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111188995] [2023-08-30 07:00:54,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:00:54,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 07:00:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:00:54,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 07:00:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-08-30 07:00:58,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 333 [2023-08-30 07:00:58,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 181 flow. Second operand has 12 states, 12 states have (on average 147.0) internal successors, (1764), 12 states have internal predecessors, (1764), 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-08-30 07:00:58,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:00:58,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 333 [2023-08-30 07:00:58,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:00,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,417 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,417 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,417 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 07:01:00,417 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,418 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,419 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,419 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 07:01:00,419 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,419 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,651 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,651 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,651 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,651 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,652 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,652 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,652 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,652 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,652 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,662 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,662 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,662 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,663 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,664 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 07:01:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,919 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,919 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,919 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,919 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,919 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,920 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,920 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,920 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,920 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,931 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,931 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,931 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,931 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,931 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:00,932 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,932 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:00,932 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 07:01:00,933 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:01,140 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,141 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,141 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:01,141 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,141 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,142 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,143 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:01,143 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,143 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,188 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,188 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,188 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:01,188 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,189 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,189 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 07:01:01,189 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,189 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,318 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,318 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,318 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,318 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,319 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,319 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,319 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,320 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,320 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,381 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,381 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,381 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,382 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,382 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,382 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 07:01:01,382 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,383 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,494 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,494 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,494 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,494 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,495 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,495 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,495 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,495 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,508 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,508 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,509 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,509 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,510 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,510 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,510 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 07:01:01,510 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,510 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,611 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,611 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,611 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,611 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,612 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,640 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,640 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,642 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,642 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 07:01:01,642 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,642 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,727 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,727 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,727 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,727 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,728 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,728 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,728 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,728 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,728 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,734 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,734 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,734 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,734 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,734 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,735 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,735 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 07:01:01,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,815 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,816 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,816 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,816 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,816 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,885 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,885 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,885 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,885 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,886 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,886 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,886 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 07:01:01,886 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,983 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 07:01:01,983 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,983 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 07:01:01,983 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 07:01:01,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 07:01:01,984 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 07:01:01,984 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 07:01:01,984 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 07:01:01,984 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 07:01:02,248 INFO L130 PetriNetUnfolder]: 9379/13043 cut-off events. [2023-08-30 07:01:02,249 INFO L131 PetriNetUnfolder]: For 8945/9353 co-relation queries the response was YES. [2023-08-30 07:01:02,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33880 conditions, 13043 events. 9379/13043 cut-off events. For 8945/9353 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 74676 event pairs, 4857 based on Foata normal form. 408/9855 useless extension candidates. Maximal degree in co-relation 33858. Up to 3404 conditions per place. [2023-08-30 07:01:02,306 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 267 selfloop transitions, 12 changer transitions 0/283 dead transitions. [2023-08-30 07:01:02,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 283 transitions, 1466 flow [2023-08-30 07:01:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 07:01:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 07:01:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2028 transitions. [2023-08-30 07:01:02,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2023-08-30 07:01:02,313 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2028 transitions. [2023-08-30 07:01:02,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2028 transitions. [2023-08-30 07:01:02,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:02,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2028 transitions. [2023-08-30 07:01:02,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 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-08-30 07:01:02,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 333.0) internal successors, (4329), 13 states have internal predecessors, (4329), 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-08-30 07:01:02,326 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 333.0) internal successors, (4329), 13 states have internal predecessors, (4329), 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-08-30 07:01:02,326 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 181 flow. Second operand 12 states and 2028 transitions. [2023-08-30 07:01:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 283 transitions, 1466 flow [2023-08-30 07:01:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 283 transitions, 1456 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 07:01:02,336 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 270 flow [2023-08-30 07:01:02,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2023-08-30 07:01:02,336 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-30 07:01:02,337 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 270 flow [2023-08-30 07:01:02,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 147.0) internal successors, (1764), 12 states have internal predecessors, (1764), 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-08-30 07:01:02,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:02,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 07:01:02,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:02,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:02,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:02,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1567315734, now seen corresponding path program 1 times [2023-08-30 07:01:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156073406] [2023-08-30 07:01:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:02,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 07:01:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:02,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 07:01:02,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:02,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:01:02,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:01:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 07:01:02,679 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 07:01:02,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 07:01:02,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-30 07:01:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:02,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:01:02,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156073406] [2023-08-30 07:01:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156073406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:01:02,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:01:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:01:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430897162] [2023-08-30 07:01:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:01:02,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:01:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:01:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:01:02,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 07:01:02,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-08-30 07:01:02,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:02,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 07:01:02,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:03,682 INFO L130 PetriNetUnfolder]: 8969/12345 cut-off events. [2023-08-30 07:01:03,682 INFO L131 PetriNetUnfolder]: For 8198/8510 co-relation queries the response was YES. [2023-08-30 07:01:03,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32218 conditions, 12345 events. 8969/12345 cut-off events. For 8198/8510 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 70648 event pairs, 4449 based on Foata normal form. 307/9014 useless extension candidates. Maximal degree in co-relation 32189. Up to 12057 conditions per place. [2023-08-30 07:01:03,741 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 41 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-08-30 07:01:03,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 46 transitions, 350 flow [2023-08-30 07:01:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:01:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:01:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-30 07:01:03,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824824824824825 [2023-08-30 07:01:03,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-30 07:01:03,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-30 07:01:03,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:03,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-30 07:01:03,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-08-30 07:01:03,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:01:03,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:01:03,747 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 270 flow. Second operand 3 states and 482 transitions. [2023-08-30 07:01:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 46 transitions, 350 flow [2023-08-30 07:01:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 46 transitions, 325 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 07:01:03,751 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 243 flow [2023-08-30 07:01:03,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-08-30 07:01:03,751 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-30 07:01:03,751 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 243 flow [2023-08-30 07:01:03,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-08-30 07:01:03,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:03,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 07:01:03,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:03,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:03,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:03,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1567315735, now seen corresponding path program 1 times [2023-08-30 07:01:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500911188] [2023-08-30 07:01:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:03,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:03,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:03,963 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:03,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 07:01:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:04,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 07:01:04,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:04,101 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 07:01:04,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2023-08-30 07:01:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:04,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:01:04,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500911188] [2023-08-30 07:01:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500911188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:01:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:01:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:01:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784319454] [2023-08-30 07:01:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:01:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:01:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:01:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:01:04,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 333 [2023-08-30 07:01:04,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-08-30 07:01:04,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:04,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 333 [2023-08-30 07:01:04,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:05,031 INFO L130 PetriNetUnfolder]: 8366/11454 cut-off events. [2023-08-30 07:01:05,031 INFO L131 PetriNetUnfolder]: For 7641/7919 co-relation queries the response was YES. [2023-08-30 07:01:05,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29942 conditions, 11454 events. 8366/11454 cut-off events. For 7641/7919 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 64108 event pairs, 4116 based on Foata normal form. 274/8581 useless extension candidates. Maximal degree in co-relation 29912. Up to 11175 conditions per place. [2023-08-30 07:01:05,070 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 07:01:05,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 44 transitions, 319 flow [2023-08-30 07:01:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:01:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:01:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-30 07:01:05,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-30 07:01:05,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-30 07:01:05,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-30 07:01:05,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:05,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-30 07:01:05,074 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-08-30 07:01:05,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:01:05,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:01:05,075 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 243 flow. Second operand 3 states and 468 transitions. [2023-08-30 07:01:05,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 44 transitions, 319 flow [2023-08-30 07:01:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 44 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:01:05,078 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 240 flow [2023-08-30 07:01:05,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=240, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-30 07:01:05,079 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-30 07:01:05,079 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 240 flow [2023-08-30 07:01:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-08-30 07:01:05,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:05,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:05,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:05,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:05,289 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:05,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1342142762, now seen corresponding path program 1 times [2023-08-30 07:01:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812872549] [2023-08-30 07:01:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:05,291 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-30 07:01:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:05,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 07:01:05,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:05,441 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:05,442 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:05,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:01:05,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812872549] [2023-08-30 07:01:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812872549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:01:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:01:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 07:01:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28910538] [2023-08-30 07:01:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:01:05,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 07:01:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 07:01:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 07:01:05,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 333 [2023-08-30 07:01:05,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 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-08-30 07:01:05,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:05,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 333 [2023-08-30 07:01:05,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:07,278 INFO L130 PetriNetUnfolder]: 11246/15768 cut-off events. [2023-08-30 07:01:07,279 INFO L131 PetriNetUnfolder]: For 10377/10835 co-relation queries the response was YES. [2023-08-30 07:01:07,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41232 conditions, 15768 events. 11246/15768 cut-off events. For 10377/10835 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 94639 event pairs, 3687 based on Foata normal form. 457/12935 useless extension candidates. Maximal degree in co-relation 41201. Up to 10314 conditions per place. [2023-08-30 07:01:07,347 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 51 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-30 07:01:07,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 414 flow [2023-08-30 07:01:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 07:01:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 07:01:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2023-08-30 07:01:07,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45885885885885885 [2023-08-30 07:01:07,350 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2023-08-30 07:01:07,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2023-08-30 07:01:07,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:07,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2023-08-30 07:01:07,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 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-08-30 07:01:07,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:01:07,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:01:07,355 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 240 flow. Second operand 5 states and 764 transitions. [2023-08-30 07:01:07,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 414 flow [2023-08-30 07:01:07,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 07:01:07,359 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 267 flow [2023-08-30 07:01:07,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-08-30 07:01:07,359 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-30 07:01:07,360 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 267 flow [2023-08-30 07:01:07,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 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-08-30 07:01:07,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:07,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:07,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:07,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:07,570 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:07,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 658995634, now seen corresponding path program 1 times [2023-08-30 07:01:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823909477] [2023-08-30 07:01:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:07,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:07,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:07,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:07,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-30 07:01:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:07,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 07:01:07,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:07,726 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:07,729 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 07:01:07,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:01:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 07:01:08,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823909477] [2023-08-30 07:01:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823909477] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:01:08,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:01:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 07:01:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495542854] [2023-08-30 07:01:08,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:01:08,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 07:01:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 07:01:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 07:01:09,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 07:01:09,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 45 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 143.4) internal successors, (1434), 10 states have internal predecessors, (1434), 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-08-30 07:01:09,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:09,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 07:01:09,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:12,212 INFO L130 PetriNetUnfolder]: 16746/23154 cut-off events. [2023-08-30 07:01:12,213 INFO L131 PetriNetUnfolder]: For 21383/23612 co-relation queries the response was YES. [2023-08-30 07:01:12,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64827 conditions, 23154 events. 16746/23154 cut-off events. For 21383/23612 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 141959 event pairs, 2542 based on Foata normal form. 2173/22219 useless extension candidates. Maximal degree in co-relation 64794. Up to 6048 conditions per place. [2023-08-30 07:01:12,472 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 96 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2023-08-30 07:01:12,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 717 flow [2023-08-30 07:01:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 07:01:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 07:01:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1229 transitions. [2023-08-30 07:01:12,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46133633633633636 [2023-08-30 07:01:12,475 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1229 transitions. [2023-08-30 07:01:12,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1229 transitions. [2023-08-30 07:01:12,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:12,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1229 transitions. [2023-08-30 07:01:12,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 153.625) internal successors, (1229), 8 states have internal predecessors, (1229), 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-08-30 07:01:12,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 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-08-30 07:01:12,482 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 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-08-30 07:01:12,482 INFO L175 Difference]: Start difference. First operand has 72 places, 45 transitions, 267 flow. Second operand 8 states and 1229 transitions. [2023-08-30 07:01:12,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 717 flow [2023-08-30 07:01:12,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 07:01:12,488 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 327 flow [2023-08-30 07:01:12,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2023-08-30 07:01:12,489 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-30 07:01:12,489 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 327 flow [2023-08-30 07:01:12,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.4) internal successors, (1434), 10 states have internal predecessors, (1434), 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-08-30 07:01:12,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:12,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:12,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:12,699 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:12,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1313961466, now seen corresponding path program 1 times [2023-08-30 07:01:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037262404] [2023-08-30 07:01:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:12,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:12,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-30 07:01:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:12,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 07:01:12,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:12,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:01:12,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037262404] [2023-08-30 07:01:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037262404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:01:12,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:01:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 07:01:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705603637] [2023-08-30 07:01:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:01:12,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 07:01:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 07:01:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 07:01:13,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 333 [2023-08-30 07:01:13,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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-08-30 07:01:13,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:13,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 333 [2023-08-30 07:01:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:14,897 INFO L130 PetriNetUnfolder]: 14963/21272 cut-off events. [2023-08-30 07:01:14,898 INFO L131 PetriNetUnfolder]: For 46835/50364 co-relation queries the response was YES. [2023-08-30 07:01:14,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69089 conditions, 21272 events. 14963/21272 cut-off events. For 46835/50364 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 129223 event pairs, 10718 based on Foata normal form. 3528/23240 useless extension candidates. Maximal degree in co-relation 69052. Up to 21110 conditions per place. [2023-08-30 07:01:15,026 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 66 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-30 07:01:15,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 529 flow [2023-08-30 07:01:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 07:01:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 07:01:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 787 transitions. [2023-08-30 07:01:15,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47267267267267266 [2023-08-30 07:01:15,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 787 transitions. [2023-08-30 07:01:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 787 transitions. [2023-08-30 07:01:15,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:15,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 787 transitions. [2023-08-30 07:01:15,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 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-08-30 07:01:15,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:01:15,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:01:15,035 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 327 flow. Second operand 5 states and 787 transitions. [2023-08-30 07:01:15,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 529 flow [2023-08-30 07:01:15,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 511 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 07:01:15,061 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 326 flow [2023-08-30 07:01:15,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2023-08-30 07:01:15,061 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-30 07:01:15,062 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 326 flow [2023-08-30 07:01:15,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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-08-30 07:01:15,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:15,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:15,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:15,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:15,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:15,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2103695100, now seen corresponding path program 1 times [2023-08-30 07:01:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443760709] [2023-08-30 07:01:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:15,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:15,274 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:15,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-08-30 07:01:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 07:01:15,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:15,441 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:15,441 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 07:01:15,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:01:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 07:01:15,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443760709] [2023-08-30 07:01:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443760709] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:01:15,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:01:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 07:01:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942044238] [2023-08-30 07:01:15,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:01:15,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 07:01:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:15,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 07:01:15,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 07:01:17,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 333 [2023-08-30 07:01:17,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 141.8) internal successors, (1418), 10 states have internal predecessors, (1418), 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-08-30 07:01:17,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:17,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 333 [2023-08-30 07:01:17,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:23,020 INFO L130 PetriNetUnfolder]: 34515/46595 cut-off events. [2023-08-30 07:01:23,021 INFO L131 PetriNetUnfolder]: For 64477/65439 co-relation queries the response was YES. [2023-08-30 07:01:23,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150902 conditions, 46595 events. 34515/46595 cut-off events. For 64477/65439 co-relation queries the response was YES. Maximal size of possible extension queue 1963. Compared 291607 event pairs, 5059 based on Foata normal form. 4237/50262 useless extension candidates. Maximal degree in co-relation 150863. Up to 12516 conditions per place. [2023-08-30 07:01:23,347 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 117 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2023-08-30 07:01:23,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 966 flow [2023-08-30 07:01:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 07:01:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 07:01:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1209 transitions. [2023-08-30 07:01:23,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45382882882882886 [2023-08-30 07:01:23,351 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1209 transitions. [2023-08-30 07:01:23,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1209 transitions. [2023-08-30 07:01:23,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:23,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1209 transitions. [2023-08-30 07:01:23,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 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-08-30 07:01:23,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 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-08-30 07:01:23,357 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 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-08-30 07:01:23,358 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 326 flow. Second operand 8 states and 1209 transitions. [2023-08-30 07:01:23,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 966 flow [2023-08-30 07:01:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 961 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 07:01:23,683 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 404 flow [2023-08-30 07:01:23,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2023-08-30 07:01:23,684 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-30 07:01:23,684 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 404 flow [2023-08-30 07:01:23,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.8) internal successors, (1418), 10 states have internal predecessors, (1418), 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-08-30 07:01:23,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:23,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:23,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-08-30 07:01:23,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:23,895 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:23,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 794906015, now seen corresponding path program 1 times [2023-08-30 07:01:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058904925] [2023-08-30 07:01:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:01:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:23,897 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:23,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-08-30 07:01:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:01:23,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 07:01:23,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:24,073 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:24,073 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:24,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:01:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:24,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:24,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058904925] [2023-08-30 07:01:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058904925] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:01:24,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:01:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 07:01:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62395781] [2023-08-30 07:01:24,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:01:24,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 07:01:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 07:01:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 07:01:28,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 333 [2023-08-30 07:01:28,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 404 flow. Second operand has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-08-30 07:01:28,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:28,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 333 [2023-08-30 07:01:28,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:35,733 INFO L130 PetriNetUnfolder]: 29141/40429 cut-off events. [2023-08-30 07:01:35,733 INFO L131 PetriNetUnfolder]: For 126617/130962 co-relation queries the response was YES. [2023-08-30 07:01:35,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156516 conditions, 40429 events. 29141/40429 cut-off events. For 126617/130962 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 244603 event pairs, 13879 based on Foata normal form. 5093/45280 useless extension candidates. Maximal degree in co-relation 156473. Up to 20281 conditions per place. [2023-08-30 07:01:36,045 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 196 selfloop transitions, 18 changer transitions 0/217 dead transitions. [2023-08-30 07:01:36,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 217 transitions, 1761 flow [2023-08-30 07:01:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 07:01:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 07:01:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2041 transitions. [2023-08-30 07:01:36,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377949377949378 [2023-08-30 07:01:36,051 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2041 transitions. [2023-08-30 07:01:36,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2041 transitions. [2023-08-30 07:01:36,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:36,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2041 transitions. [2023-08-30 07:01:36,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 145.78571428571428) internal successors, (2041), 14 states have internal predecessors, (2041), 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-08-30 07:01:36,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 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-08-30 07:01:36,060 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 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-08-30 07:01:36,060 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 404 flow. Second operand 14 states and 2041 transitions. [2023-08-30 07:01:36,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 217 transitions, 1761 flow [2023-08-30 07:01:36,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 217 transitions, 1698 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-30 07:01:36,298 INFO L231 Difference]: Finished difference. Result has 106 places, 62 transitions, 478 flow [2023-08-30 07:01:36,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=478, PETRI_PLACES=106, PETRI_TRANSITIONS=62} [2023-08-30 07:01:36,299 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2023-08-30 07:01:36,299 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 62 transitions, 478 flow [2023-08-30 07:01:36,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-08-30 07:01:36,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:36,300 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:36,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-08-30 07:01:36,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:36,509 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:36,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -152326489, now seen corresponding path program 2 times [2023-08-30 07:01:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115892559] [2023-08-30 07:01:36,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 07:01:36,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:36,511 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:36,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-08-30 07:01:36,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 07:01:36,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:01:36,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 07:01:36,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:36,708 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:36,708 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:36,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:01:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:37,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115892559] [2023-08-30 07:01:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115892559] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:01:37,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:01:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-08-30 07:01:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656192674] [2023-08-30 07:01:37,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:01:37,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 07:01:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 07:01:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-30 07:01:43,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 07:01:43,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 62 transitions, 478 flow. Second operand has 17 states, 17 states have (on average 139.1764705882353) internal successors, (2366), 17 states have internal predecessors, (2366), 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-08-30 07:01:43,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:01:43,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 07:01:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:01:53,368 INFO L130 PetriNetUnfolder]: 32361/44349 cut-off events. [2023-08-30 07:01:53,368 INFO L131 PetriNetUnfolder]: For 143168/150455 co-relation queries the response was YES. [2023-08-30 07:01:53,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186048 conditions, 44349 events. 32361/44349 cut-off events. For 143168/150455 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 283393 event pairs, 14453 based on Foata normal form. 6093/49688 useless extension candidates. Maximal degree in co-relation 186001. Up to 28090 conditions per place. [2023-08-30 07:01:53,728 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 302 selfloop transitions, 26 changer transitions 0/333 dead transitions. [2023-08-30 07:01:53,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 333 transitions, 2616 flow [2023-08-30 07:01:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 07:01:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 07:01:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2723 transitions. [2023-08-30 07:01:53,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542876209542876 [2023-08-30 07:01:53,736 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2723 transitions. [2023-08-30 07:01:53,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2723 transitions. [2023-08-30 07:01:53,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:01:53,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2723 transitions. [2023-08-30 07:01:53,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 151.27777777777777) internal successors, (2723), 18 states have internal predecessors, (2723), 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-08-30 07:01:53,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 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-08-30 07:01:53,748 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 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-08-30 07:01:53,749 INFO L175 Difference]: Start difference. First operand has 106 places, 62 transitions, 478 flow. Second operand 18 states and 2723 transitions. [2023-08-30 07:01:53,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 333 transitions, 2616 flow [2023-08-30 07:01:54,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 333 transitions, 2556 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-30 07:01:54,195 INFO L231 Difference]: Finished difference. Result has 118 places, 77 transitions, 634 flow [2023-08-30 07:01:54,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=634, PETRI_PLACES=118, PETRI_TRANSITIONS=77} [2023-08-30 07:01:54,195 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2023-08-30 07:01:54,195 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 77 transitions, 634 flow [2023-08-30 07:01:54,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 139.1764705882353) internal successors, (2366), 17 states have internal predecessors, (2366), 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-08-30 07:01:54,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:01:54,196 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:01:54,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-08-30 07:01:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:54,397 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:01:54,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:01:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -979220145, now seen corresponding path program 2 times [2023-08-30 07:01:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:01:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767237727] [2023-08-30 07:01:54,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 07:01:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:01:54,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:01:54,398 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:01:54,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-08-30 07:01:54,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 07:01:54,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:01:54,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 07:01:54,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:01:54,581 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:01:54,582 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:01:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:54,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:01:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:01:55,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:01:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767237727] [2023-08-30 07:01:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767237727] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:01:55,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:01:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-08-30 07:01:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474957901] [2023-08-30 07:01:55,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:01:55,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 07:01:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:01:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 07:01:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-30 07:02:03,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 07:02:03,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 77 transitions, 634 flow. Second operand has 17 states, 17 states have (on average 139.41176470588235) internal successors, (2370), 17 states have internal predecessors, (2370), 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-08-30 07:02:03,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:02:03,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 07:02:03,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:02:12,728 INFO L130 PetriNetUnfolder]: 30603/42180 cut-off events. [2023-08-30 07:02:12,728 INFO L131 PetriNetUnfolder]: For 170570/175156 co-relation queries the response was YES. [2023-08-30 07:02:12,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190215 conditions, 42180 events. 30603/42180 cut-off events. For 170570/175156 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 270080 event pairs, 15280 based on Foata normal form. 3049/44230 useless extension candidates. Maximal degree in co-relation 190167. Up to 30358 conditions per place. [2023-08-30 07:02:13,094 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 278 selfloop transitions, 26 changer transitions 0/312 dead transitions. [2023-08-30 07:02:13,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 312 transitions, 2555 flow [2023-08-30 07:02:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 07:02:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 07:02:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2707 transitions. [2023-08-30 07:02:13,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161828495161827 [2023-08-30 07:02:13,102 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2707 transitions. [2023-08-30 07:02:13,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2707 transitions. [2023-08-30 07:02:13,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:02:13,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2707 transitions. [2023-08-30 07:02:13,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 150.38888888888889) internal successors, (2707), 18 states have internal predecessors, (2707), 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-08-30 07:02:13,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 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-08-30 07:02:13,112 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 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-08-30 07:02:13,112 INFO L175 Difference]: Start difference. First operand has 118 places, 77 transitions, 634 flow. Second operand 18 states and 2707 transitions. [2023-08-30 07:02:13,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 312 transitions, 2555 flow [2023-08-30 07:02:13,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 312 transitions, 2488 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-30 07:02:13,906 INFO L231 Difference]: Finished difference. Result has 136 places, 88 transitions, 795 flow [2023-08-30 07:02:13,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=795, PETRI_PLACES=136, PETRI_TRANSITIONS=88} [2023-08-30 07:02:13,907 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 85 predicate places. [2023-08-30 07:02:13,907 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 88 transitions, 795 flow [2023-08-30 07:02:13,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 139.41176470588235) internal successors, (2370), 17 states have internal predecessors, (2370), 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-08-30 07:02:13,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:02:13,908 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-08-30 07:02:13,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-08-30 07:02:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:02:14,117 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:02:14,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:02:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1674697708, now seen corresponding path program 3 times [2023-08-30 07:02:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:02:14,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456718827] [2023-08-30 07:02:14,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 07:02:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:02:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:02:14,119 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:02:14,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-08-30 07:02:14,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-30 07:02:14,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:02:14,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 07:02:14,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:02:14,347 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:02:14,348 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:02:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:02:14,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:02:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:02:16,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:02:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456718827] [2023-08-30 07:02:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456718827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:02:16,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:02:16,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-08-30 07:02:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062215862] [2023-08-30 07:02:16,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:02:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 07:02:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:02:16,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 07:02:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-08-30 07:02:29,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 333 [2023-08-30 07:02:29,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 88 transitions, 795 flow. Second operand has 24 states, 24 states have (on average 147.0) internal successors, (3528), 24 states have internal predecessors, (3528), 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-08-30 07:02:29,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:02:29,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 333 [2023-08-30 07:02:29,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:02:58,888 INFO L130 PetriNetUnfolder]: 75695/103881 cut-off events. [2023-08-30 07:02:58,888 INFO L131 PetriNetUnfolder]: For 548522/567521 co-relation queries the response was YES. [2023-08-30 07:02:59,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502088 conditions, 103881 events. 75695/103881 cut-off events. For 548522/567521 co-relation queries the response was YES. Maximal size of possible extension queue 2666. Compared 688403 event pairs, 47981 based on Foata normal form. 12502/115749 useless extension candidates. Maximal degree in co-relation 502033. Up to 26863 conditions per place. [2023-08-30 07:03:00,022 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 734 selfloop transitions, 24 changer transitions 0/770 dead transitions. [2023-08-30 07:03:00,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 770 transitions, 7003 flow [2023-08-30 07:03:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 07:03:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 07:03:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4017 transitions. [2023-08-30 07:03:00,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026276276276276 [2023-08-30 07:03:00,027 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4017 transitions. [2023-08-30 07:03:00,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4017 transitions. [2023-08-30 07:03:00,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:03:00,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4017 transitions. [2023-08-30 07:03:00,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 167.375) internal successors, (4017), 24 states have internal predecessors, (4017), 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-08-30 07:03:00,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 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-08-30 07:03:00,035 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 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-08-30 07:03:00,035 INFO L175 Difference]: Start difference. First operand has 136 places, 88 transitions, 795 flow. Second operand 24 states and 4017 transitions. [2023-08-30 07:03:00,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 770 transitions, 7003 flow [2023-08-30 07:03:04,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 770 transitions, 6978 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 07:03:04,463 INFO L231 Difference]: Finished difference. Result has 168 places, 101 transitions, 963 flow [2023-08-30 07:03:04,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=963, PETRI_PLACES=168, PETRI_TRANSITIONS=101} [2023-08-30 07:03:04,464 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 117 predicate places. [2023-08-30 07:03:04,464 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 101 transitions, 963 flow [2023-08-30 07:03:04,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 147.0) internal successors, (3528), 24 states have internal predecessors, (3528), 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-08-30 07:03:04,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:03:04,464 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1] [2023-08-30 07:03:04,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-08-30 07:03:04,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:03:04,665 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:03:04,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:03:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1023231657, now seen corresponding path program 3 times [2023-08-30 07:03:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:03:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193704550] [2023-08-30 07:03:04,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 07:03:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:03:04,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:03:04,667 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:03:04,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-08-30 07:03:04,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 07:03:04,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:03:04,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-30 07:03:04,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:03:04,908 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:03:04,908 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:03:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 07:03:05,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:03:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 07:03:05,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:03:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193704550] [2023-08-30 07:03:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193704550] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:03:05,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:03:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-30 07:03:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109660976] [2023-08-30 07:03:05,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:03:05,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 07:03:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:03:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 07:03:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-08-30 07:03:09,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-08-30 07:03:09,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 101 transitions, 963 flow. Second operand has 16 states, 16 states have (on average 140.25) internal successors, (2244), 16 states have internal predecessors, (2244), 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-08-30 07:03:09,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:03:09,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-08-30 07:03:09,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:03:25,045 INFO L130 PetriNetUnfolder]: 73981/100921 cut-off events. [2023-08-30 07:03:25,045 INFO L131 PetriNetUnfolder]: For 495364/511171 co-relation queries the response was YES. [2023-08-30 07:03:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488430 conditions, 100921 events. 73981/100921 cut-off events. For 495364/511171 co-relation queries the response was YES. Maximal size of possible extension queue 2427. Compared 664060 event pairs, 44223 based on Foata normal form. 10016/109548 useless extension candidates. Maximal degree in co-relation 488361. Up to 94485 conditions per place. [2023-08-30 07:03:26,624 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 248 selfloop transitions, 17 changer transitions 0/273 dead transitions. [2023-08-30 07:03:26,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 273 transitions, 2579 flow [2023-08-30 07:03:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 07:03:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 07:03:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2254 transitions. [2023-08-30 07:03:26,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45125125125125126 [2023-08-30 07:03:26,627 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2254 transitions. [2023-08-30 07:03:26,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2254 transitions. [2023-08-30 07:03:26,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:03:26,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2254 transitions. [2023-08-30 07:03:26,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 150.26666666666668) internal successors, (2254), 15 states have internal predecessors, (2254), 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-08-30 07:03:26,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 333.0) internal successors, (5328), 16 states have internal predecessors, (5328), 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-08-30 07:03:26,633 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 333.0) internal successors, (5328), 16 states have internal predecessors, (5328), 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-08-30 07:03:26,633 INFO L175 Difference]: Start difference. First operand has 168 places, 101 transitions, 963 flow. Second operand 15 states and 2254 transitions. [2023-08-30 07:03:26,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 273 transitions, 2579 flow [2023-08-30 07:03:30,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 273 transitions, 2531 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-30 07:03:30,661 INFO L231 Difference]: Finished difference. Result has 176 places, 104 transitions, 995 flow [2023-08-30 07:03:30,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=995, PETRI_PLACES=176, PETRI_TRANSITIONS=104} [2023-08-30 07:03:30,661 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 125 predicate places. [2023-08-30 07:03:30,662 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 104 transitions, 995 flow [2023-08-30 07:03:30,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 140.25) internal successors, (2244), 16 states have internal predecessors, (2244), 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-08-30 07:03:30,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:03:30,662 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:03:30,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-08-30 07:03:30,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:03:30,863 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:03:30,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:03:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1723796892, now seen corresponding path program 1 times [2023-08-30 07:03:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:03:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149577349] [2023-08-30 07:03:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:03:30,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:03:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:03:30,865 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:03:30,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-08-30 07:03:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:03:30,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 07:03:30,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:03:31,047 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:03:31,048 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:03:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:03:31,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:03:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:03:32,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:03:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149577349] [2023-08-30 07:03:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149577349] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:03:32,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:03:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-30 07:03:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241398151] [2023-08-30 07:03:32,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:03:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 07:03:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:03:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 07:03:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-08-30 07:03:41,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-08-30 07:03:41,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 104 transitions, 995 flow. Second operand has 14 states, 14 states have (on average 136.71428571428572) internal successors, (1914), 14 states have internal predecessors, (1914), 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-08-30 07:03:41,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:03:41,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-08-30 07:03:41,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:04:04,054 INFO L130 PetriNetUnfolder]: 75108/104731 cut-off events. [2023-08-30 07:04:04,054 INFO L131 PetriNetUnfolder]: For 568812/582262 co-relation queries the response was YES. [2023-08-30 07:04:05,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494303 conditions, 104731 events. 75108/104731 cut-off events. For 568812/582262 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 688174 event pairs, 34615 based on Foata normal form. 11824/115987 useless extension candidates. Maximal degree in co-relation 494229. Up to 54100 conditions per place. [2023-08-30 07:04:05,507 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 378 selfloop transitions, 43 changer transitions 0/430 dead transitions. [2023-08-30 07:04:05,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 430 transitions, 4402 flow [2023-08-30 07:04:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 07:04:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 07:04:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3338 transitions. [2023-08-30 07:04:05,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358271314793054 [2023-08-30 07:04:05,512 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3338 transitions. [2023-08-30 07:04:05,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3338 transitions. [2023-08-30 07:04:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:04:05,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3338 transitions. [2023-08-30 07:04:05,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 145.1304347826087) internal successors, (3338), 23 states have internal predecessors, (3338), 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-08-30 07:04:05,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 333.0) internal successors, (7992), 24 states have internal predecessors, (7992), 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-08-30 07:04:05,519 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 333.0) internal successors, (7992), 24 states have internal predecessors, (7992), 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-08-30 07:04:05,519 INFO L175 Difference]: Start difference. First operand has 176 places, 104 transitions, 995 flow. Second operand 23 states and 3338 transitions. [2023-08-30 07:04:05,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 430 transitions, 4402 flow [2023-08-30 07:04:09,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 430 transitions, 4370 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 07:04:09,594 INFO L231 Difference]: Finished difference. Result has 197 places, 129 transitions, 1319 flow [2023-08-30 07:04:09,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1319, PETRI_PLACES=197, PETRI_TRANSITIONS=129} [2023-08-30 07:04:09,594 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 146 predicate places. [2023-08-30 07:04:09,594 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 129 transitions, 1319 flow [2023-08-30 07:04:09,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 136.71428571428572) internal successors, (1914), 14 states have internal predecessors, (1914), 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-08-30 07:04:09,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:04:09,595 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2023-08-30 07:04:09,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-08-30 07:04:09,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:04:09,796 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:04:09,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:04:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1973060498, now seen corresponding path program 4 times [2023-08-30 07:04:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:04:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176426290] [2023-08-30 07:04:09,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 07:04:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:04:09,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:04:09,797 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:04:09,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-08-30 07:04:09,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 07:04:09,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:04:09,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 07:04:09,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:04:10,014 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:04:10,014 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:04:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 07:04:10,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:04:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:04:11,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:04:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176426290] [2023-08-30 07:04:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176426290] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:04:11,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:04:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2023-08-30 07:04:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147441108] [2023-08-30 07:04:11,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:04:11,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 07:04:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:04:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 07:04:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-08-30 07:04:26,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 333 [2023-08-30 07:04:26,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 129 transitions, 1319 flow. Second operand has 22 states, 22 states have (on average 138.1818181818182) internal successors, (3040), 22 states have internal predecessors, (3040), 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-08-30 07:04:26,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:04:26,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 333 [2023-08-30 07:04:26,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:04:45,672 INFO L130 PetriNetUnfolder]: 76746/104803 cut-off events. [2023-08-30 07:04:45,672 INFO L131 PetriNetUnfolder]: For 810357/828094 co-relation queries the response was YES. [2023-08-30 07:04:46,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584121 conditions, 104803 events. 76746/104803 cut-off events. For 810357/828094 co-relation queries the response was YES. Maximal size of possible extension queue 2506. Compared 686811 event pairs, 41272 based on Foata normal form. 11113/113707 useless extension candidates. Maximal degree in co-relation 584041. Up to 88262 conditions per place. [2023-08-30 07:04:47,372 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 435 selfloop transitions, 50 changer transitions 0/495 dead transitions. [2023-08-30 07:04:47,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 495 transitions, 5074 flow [2023-08-30 07:04:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 07:04:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 07:04:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3591 transitions. [2023-08-30 07:04:47,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2023-08-30 07:04:47,375 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3591 transitions. [2023-08-30 07:04:47,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3591 transitions. [2023-08-30 07:04:47,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:04:47,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3591 transitions. [2023-08-30 07:04:47,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 149.625) internal successors, (3591), 24 states have internal predecessors, (3591), 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-08-30 07:04:47,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 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-08-30 07:04:47,382 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 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-08-30 07:04:47,382 INFO L175 Difference]: Start difference. First operand has 197 places, 129 transitions, 1319 flow. Second operand 24 states and 3591 transitions. [2023-08-30 07:04:47,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 495 transitions, 5074 flow [2023-08-30 07:04:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 495 transitions, 4822 flow, removed 100 selfloop flow, removed 10 redundant places. [2023-08-30 07:04:53,013 INFO L231 Difference]: Finished difference. Result has 211 places, 146 transitions, 1639 flow [2023-08-30 07:04:53,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1639, PETRI_PLACES=211, PETRI_TRANSITIONS=146} [2023-08-30 07:04:53,014 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 160 predicate places. [2023-08-30 07:04:53,014 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 146 transitions, 1639 flow [2023-08-30 07:04:53,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 138.1818181818182) internal successors, (3040), 22 states have internal predecessors, (3040), 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-08-30 07:04:53,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:04:53,015 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:04:53,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-08-30 07:04:53,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:04:53,215 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:04:53,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:04:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -10700998, now seen corresponding path program 2 times [2023-08-30 07:04:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:04:53,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367458250] [2023-08-30 07:04:53,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 07:04:53,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:04:53,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:04:53,217 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:04:53,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-08-30 07:04:53,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 07:04:53,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:04:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 07:04:53,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:04:53,393 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:04:53,393 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:04:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 07:04:53,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:04:53,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:04:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367458250] [2023-08-30 07:04:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367458250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:04:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:04:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 07:04:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163170845] [2023-08-30 07:04:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:04:53,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 07:04:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:04:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 07:04:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 07:04:53,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-08-30 07:04:53,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 146 transitions, 1639 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-08-30 07:04:53,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:04:53,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-08-30 07:04:53,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:05:05,212 INFO L130 PetriNetUnfolder]: 59502/83028 cut-off events. [2023-08-30 07:05:05,213 INFO L131 PetriNetUnfolder]: For 756545/767832 co-relation queries the response was YES. [2023-08-30 07:05:06,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448272 conditions, 83028 events. 59502/83028 cut-off events. For 756545/767832 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 534579 event pairs, 12826 based on Foata normal form. 14046/96105 useless extension candidates. Maximal degree in co-relation 448193. Up to 55866 conditions per place. [2023-08-30 07:05:06,380 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 173 selfloop transitions, 16 changer transitions 0/198 dead transitions. [2023-08-30 07:05:06,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 198 transitions, 2696 flow [2023-08-30 07:05:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 07:05:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 07:05:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-08-30 07:05:06,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45165165165165166 [2023-08-30 07:05:06,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-08-30 07:05:06,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-08-30 07:05:06,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:05:06,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-08-30 07:05:06,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 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-08-30 07:05:06,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:05:06,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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-08-30 07:05:06,385 INFO L175 Difference]: Start difference. First operand has 211 places, 146 transitions, 1639 flow. Second operand 5 states and 752 transitions. [2023-08-30 07:05:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 198 transitions, 2696 flow [2023-08-30 07:05:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 198 transitions, 2368 flow, removed 109 selfloop flow, removed 23 redundant places. [2023-08-30 07:05:10,970 INFO L231 Difference]: Finished difference. Result has 191 places, 145 transitions, 1444 flow [2023-08-30 07:05:10,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1444, PETRI_PLACES=191, PETRI_TRANSITIONS=145} [2023-08-30 07:05:10,971 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 140 predicate places. [2023-08-30 07:05:10,971 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 145 transitions, 1444 flow [2023-08-30 07:05:10,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-08-30 07:05:10,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:05:10,971 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2023-08-30 07:05:10,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-08-30 07:05:11,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:05:11,175 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:05:11,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:05:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -957933502, now seen corresponding path program 5 times [2023-08-30 07:05:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:05:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146278203] [2023-08-30 07:05:11,176 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 07:05:11,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:05:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:05:11,178 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:05:11,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-08-30 07:05:11,304 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 07:05:11,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:05:11,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 07:05:11,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:05:11,394 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:05:11,394 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:05:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:05:11,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:05:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:05:13,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:05:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146278203] [2023-08-30 07:05:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146278203] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:05:13,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:05:13,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-08-30 07:05:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986802656] [2023-08-30 07:05:13,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:05:13,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 07:05:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:05:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 07:05:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2023-08-30 07:05:28,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 333 [2023-08-30 07:05:28,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 145 transitions, 1444 flow. Second operand has 24 states, 24 states have (on average 137.08333333333334) internal successors, (3290), 24 states have internal predecessors, (3290), 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-08-30 07:05:28,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:05:28,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 333 [2023-08-30 07:05:28,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:06:02,863 INFO L130 PetriNetUnfolder]: 80373/108254 cut-off events. [2023-08-30 07:06:02,863 INFO L131 PetriNetUnfolder]: For 1288853/1308304 co-relation queries the response was YES. [2023-08-30 07:06:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610849 conditions, 108254 events. 80373/108254 cut-off events. For 1288853/1308304 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 686709 event pairs, 4141 based on Foata normal form. 24729/132592 useless extension candidates. Maximal degree in co-relation 610777. Up to 29001 conditions per place. [2023-08-30 07:06:04,247 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 828 selfloop transitions, 56 changer transitions 0/894 dead transitions. [2023-08-30 07:06:04,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 894 transitions, 9841 flow [2023-08-30 07:06:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-30 07:06:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-30 07:06:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6333 transitions. [2023-08-30 07:06:04,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44227948879111667 [2023-08-30 07:06:04,256 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6333 transitions. [2023-08-30 07:06:04,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6333 transitions. [2023-08-30 07:06:04,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:06:04,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6333 transitions. [2023-08-30 07:06:04,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 147.27906976744185) internal successors, (6333), 43 states have internal predecessors, (6333), 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-08-30 07:06:04,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 333.0) internal successors, (14652), 44 states have internal predecessors, (14652), 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-08-30 07:06:04,272 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 333.0) internal successors, (14652), 44 states have internal predecessors, (14652), 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-08-30 07:06:04,272 INFO L175 Difference]: Start difference. First operand has 191 places, 145 transitions, 1444 flow. Second operand 43 states and 6333 transitions. [2023-08-30 07:06:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 894 transitions, 9841 flow [2023-08-30 07:06:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 894 transitions, 9815 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 07:06:08,271 INFO L231 Difference]: Finished difference. Result has 230 places, 165 transitions, 1656 flow [2023-08-30 07:06:08,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1656, PETRI_PLACES=230, PETRI_TRANSITIONS=165} [2023-08-30 07:06:08,271 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 179 predicate places. [2023-08-30 07:06:08,272 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 165 transitions, 1656 flow [2023-08-30 07:06:08,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 137.08333333333334) internal successors, (3290), 24 states have internal predecessors, (3290), 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-08-30 07:06:08,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:06:08,272 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:06:08,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-08-30 07:06:08,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:06:08,474 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:06:08,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:06:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1895274271, now seen corresponding path program 3 times [2023-08-30 07:06:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:06:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709978220] [2023-08-30 07:06:08,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 07:06:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:06:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:06:08,477 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:06:08,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-08-30 07:06:08,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 07:06:08,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:06:08,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 07:06:08,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:06:08,788 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:06:08,789 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:06:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:06:09,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:06:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:06:10,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:06:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709978220] [2023-08-30 07:06:10,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709978220] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:06:10,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:06:10,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-08-30 07:06:10,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456236438] [2023-08-30 07:06:10,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:06:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 07:06:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:06:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 07:06:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-08-30 07:06:20,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 07:06:20,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 165 transitions, 1656 flow. Second operand has 21 states, 21 states have (on average 139.33333333333334) internal successors, (2926), 21 states have internal predecessors, (2926), 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-08-30 07:06:20,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:06:20,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 07:06:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:06:43,880 INFO L130 PetriNetUnfolder]: 88786/119937 cut-off events. [2023-08-30 07:06:43,880 INFO L131 PetriNetUnfolder]: For 1244191/1256334 co-relation queries the response was YES. [2023-08-30 07:06:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707019 conditions, 119937 events. 88786/119937 cut-off events. For 1244191/1256334 co-relation queries the response was YES. Maximal size of possible extension queue 2358. Compared 754523 event pairs, 45207 based on Foata normal form. 5662/124161 useless extension candidates. Maximal degree in co-relation 706947. Up to 93287 conditions per place. [2023-08-30 07:06:45,484 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 630 selfloop transitions, 59 changer transitions 0/700 dead transitions. [2023-08-30 07:06:45,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 700 transitions, 7087 flow [2023-08-30 07:06:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 07:06:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 07:06:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3757 transitions. [2023-08-30 07:06:45,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512912912912913 [2023-08-30 07:06:45,492 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3757 transitions. [2023-08-30 07:06:45,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3757 transitions. [2023-08-30 07:06:45,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:06:45,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3757 transitions. [2023-08-30 07:06:45,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 150.28) internal successors, (3757), 25 states have internal predecessors, (3757), 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-08-30 07:06:45,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 333.0) internal successors, (8658), 26 states have internal predecessors, (8658), 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-08-30 07:06:45,508 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 333.0) internal successors, (8658), 26 states have internal predecessors, (8658), 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-08-30 07:06:45,508 INFO L175 Difference]: Start difference. First operand has 230 places, 165 transitions, 1656 flow. Second operand 25 states and 3757 transitions. [2023-08-30 07:06:45,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 700 transitions, 7087 flow [2023-08-30 07:06:50,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 700 transitions, 5761 flow, removed 368 selfloop flow, removed 25 redundant places. [2023-08-30 07:06:50,388 INFO L231 Difference]: Finished difference. Result has 237 places, 181 transitions, 1807 flow [2023-08-30 07:06:50,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1807, PETRI_PLACES=237, PETRI_TRANSITIONS=181} [2023-08-30 07:06:50,389 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 186 predicate places. [2023-08-30 07:06:50,389 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 181 transitions, 1807 flow [2023-08-30 07:06:50,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 139.33333333333334) internal successors, (2926), 21 states have internal predecessors, (2926), 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-08-30 07:06:50,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:06:50,390 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:06:50,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-08-30 07:06:50,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:06:50,591 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:06:50,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:06:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2073446358, now seen corresponding path program 4 times [2023-08-30 07:06:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:06:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040818848] [2023-08-30 07:06:50,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 07:06:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:06:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:06:50,593 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:06:50,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-08-30 07:06:50,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 07:06:50,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:06:50,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 07:06:50,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:06:50,796 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:06:50,796 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:06:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 07:06:51,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:06:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 07:06:51,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:06:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040818848] [2023-08-30 07:06:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040818848] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:06:51,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:06:51,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-30 07:06:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401741143] [2023-08-30 07:06:51,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:06:51,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 07:06:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:06:51,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 07:06:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-08-30 07:06:59,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 333 [2023-08-30 07:06:59,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 181 transitions, 1807 flow. Second operand has 16 states, 16 states have (on average 142.5) internal successors, (2280), 16 states have internal predecessors, (2280), 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-08-30 07:06:59,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:06:59,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 333 [2023-08-30 07:06:59,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:07:43,679 INFO L130 PetriNetUnfolder]: 181128/245980 cut-off events. [2023-08-30 07:07:43,679 INFO L131 PetriNetUnfolder]: For 2599782/2621348 co-relation queries the response was YES. [2023-08-30 07:07:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385973 conditions, 245980 events. 181128/245980 cut-off events. For 2599782/2621348 co-relation queries the response was YES. Maximal size of possible extension queue 4724. Compared 1733878 event pairs, 14466 based on Foata normal form. 21982/264037 useless extension candidates. Maximal degree in co-relation 1385902. Up to 66309 conditions per place. [2023-08-30 07:07:47,188 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 683 selfloop transitions, 58 changer transitions 0/752 dead transitions. [2023-08-30 07:07:47,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 752 transitions, 6745 flow [2023-08-30 07:07:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 07:07:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 07:07:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2161 transitions. [2023-08-30 07:07:47,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46353496353496354 [2023-08-30 07:07:47,192 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2161 transitions. [2023-08-30 07:07:47,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2161 transitions. [2023-08-30 07:07:47,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:07:47,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2161 transitions. [2023-08-30 07:07:47,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.35714285714286) internal successors, (2161), 14 states have internal predecessors, (2161), 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-08-30 07:07:47,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 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-08-30 07:07:47,198 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 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-08-30 07:07:47,198 INFO L175 Difference]: Start difference. First operand has 237 places, 181 transitions, 1807 flow. Second operand 14 states and 2161 transitions. [2023-08-30 07:07:47,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 752 transitions, 6745 flow [2023-08-30 07:08:00,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 752 transitions, 6524 flow, removed 20 selfloop flow, removed 11 redundant places. [2023-08-30 07:08:00,287 INFO L231 Difference]: Finished difference. Result has 246 places, 192 transitions, 2084 flow [2023-08-30 07:08:00,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2084, PETRI_PLACES=246, PETRI_TRANSITIONS=192} [2023-08-30 07:08:00,288 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 195 predicate places. [2023-08-30 07:08:00,288 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 192 transitions, 2084 flow [2023-08-30 07:08:00,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 142.5) internal successors, (2280), 16 states have internal predecessors, (2280), 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-08-30 07:08:00,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:08:00,289 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 4, 1, 1, 1, 1, 1] [2023-08-30 07:08:00,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-08-30 07:08:00,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:08:00,498 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:08:00,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:08:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1934412834, now seen corresponding path program 6 times [2023-08-30 07:08:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:08:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302975214] [2023-08-30 07:08:00,499 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 07:08:00,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:08:00,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:08:00,500 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:08:00,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-08-30 07:08:00,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-08-30 07:08:00,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:08:00,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 07:08:00,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:08:00,908 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:08:00,908 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:08:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:08:01,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:08:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:08:04,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:08:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302975214] [2023-08-30 07:08:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302975214] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:08:04,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:08:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2023-08-30 07:08:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035032352] [2023-08-30 07:08:04,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:08:04,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 07:08:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:08:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 07:08:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2023-08-30 07:08:36,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 07:08:36,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 192 transitions, 2084 flow. Second operand has 35 states, 35 states have (on average 139.0857142857143) internal successors, (4868), 35 states have internal predecessors, (4868), 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-08-30 07:08:36,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:08:36,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 07:08:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:09:45,187 INFO L130 PetriNetUnfolder]: 194518/268677 cut-off events. [2023-08-30 07:09:45,187 INFO L131 PetriNetUnfolder]: For 4216759/4255102 co-relation queries the response was YES. [2023-08-30 07:09:47,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631312 conditions, 268677 events. 194518/268677 cut-off events. For 4216759/4255102 co-relation queries the response was YES. Maximal size of possible extension queue 6165. Compared 1995015 event pairs, 69814 based on Foata normal form. 18511/277868 useless extension candidates. Maximal degree in co-relation 1631235. Up to 133264 conditions per place. [2023-08-30 07:09:49,512 INFO L137 encePairwiseOnDemand]: 323/333 looper letters, 1038 selfloop transitions, 104 changer transitions 0/1154 dead transitions. [2023-08-30 07:09:49,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1154 transitions, 15579 flow [2023-08-30 07:09:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-30 07:09:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-30 07:09:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 7487 transitions. [2023-08-30 07:09:49,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44966966966966965 [2023-08-30 07:09:49,521 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 7487 transitions. [2023-08-30 07:09:49,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 7487 transitions. [2023-08-30 07:09:49,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:09:49,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 7487 transitions. [2023-08-30 07:09:49,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 149.74) internal successors, (7487), 50 states have internal predecessors, (7487), 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-08-30 07:09:49,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 333.0) internal successors, (16983), 51 states have internal predecessors, (16983), 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-08-30 07:09:49,541 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 333.0) internal successors, (16983), 51 states have internal predecessors, (16983), 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-08-30 07:09:49,542 INFO L175 Difference]: Start difference. First operand has 246 places, 192 transitions, 2084 flow. Second operand 50 states and 7487 transitions. [2023-08-30 07:09:49,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1154 transitions, 15579 flow [2023-08-30 07:10:09,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 1154 transitions, 14141 flow, removed 551 selfloop flow, removed 6 redundant places. [2023-08-30 07:10:09,431 INFO L231 Difference]: Finished difference. Result has 299 places, 229 transitions, 2627 flow [2023-08-30 07:10:09,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=2627, PETRI_PLACES=299, PETRI_TRANSITIONS=229} [2023-08-30 07:10:09,432 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 248 predicate places. [2023-08-30 07:10:09,432 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 229 transitions, 2627 flow [2023-08-30 07:10:09,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 139.0857142857143) internal successors, (4868), 35 states have internal predecessors, (4868), 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-08-30 07:10:09,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:10:09,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:10:09,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-08-30 07:10:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:10:09,634 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:10:09,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:10:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash -50844043, now seen corresponding path program 1 times [2023-08-30 07:10:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:10:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339765562] [2023-08-30 07:10:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 07:10:09,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:10:09,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:10:09,636 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:10:09,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-08-30 07:10:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 07:10:09,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 07:10:09,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:10:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:10:09,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 07:10:09,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:10:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339765562] [2023-08-30 07:10:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339765562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 07:10:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 07:10:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 07:10:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758310558] [2023-08-30 07:10:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 07:10:09,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 07:10:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:10:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 07:10:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 07:10:09,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 333 [2023-08-30 07:10:09,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 229 transitions, 2627 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-30 07:10:09,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:10:09,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 333 [2023-08-30 07:10:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 07:11:04,688 INFO L130 PetriNetUnfolder]: 192474/266070 cut-off events. [2023-08-30 07:11:04,688 INFO L131 PetriNetUnfolder]: For 4487917/4527848 co-relation queries the response was YES. [2023-08-30 07:11:08,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627933 conditions, 266070 events. 192474/266070 cut-off events. For 4487917/4527848 co-relation queries the response was YES. Maximal size of possible extension queue 6097. Compared 1978032 event pairs, 72462 based on Foata normal form. 19249/284499 useless extension candidates. Maximal degree in co-relation 1627846. Up to 263395 conditions per place. [2023-08-30 07:11:10,006 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 221 selfloop transitions, 31 changer transitions 8/276 dead transitions. [2023-08-30 07:11:10,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 276 transitions, 3595 flow [2023-08-30 07:11:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 07:11:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 07:11:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-30 07:11:10,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035035035035035 [2023-08-30 07:11:10,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-30 07:11:10,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-30 07:11:10,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 07:11:10,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-30 07:11:10,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-08-30 07:11:10,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:11:10,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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-08-30 07:11:10,009 INFO L175 Difference]: Start difference. First operand has 299 places, 229 transitions, 2627 flow. Second operand 3 states and 503 transitions. [2023-08-30 07:11:10,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 276 transitions, 3595 flow [2023-08-30 07:11:35,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 276 transitions, 3252 flow, removed 95 selfloop flow, removed 27 redundant places. [2023-08-30 07:11:35,069 INFO L231 Difference]: Finished difference. Result has 275 places, 250 transitions, 2757 flow [2023-08-30 07:11:35,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2757, PETRI_PLACES=275, PETRI_TRANSITIONS=250} [2023-08-30 07:11:35,069 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 224 predicate places. [2023-08-30 07:11:35,070 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 250 transitions, 2757 flow [2023-08-30 07:11:35,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-30 07:11:35,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 07:11:35,070 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 07:11:35,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-08-30 07:11:35,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:11:35,279 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 07:11:35,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 07:11:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1415625103, now seen corresponding path program 5 times [2023-08-30 07:11:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 07:11:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957580218] [2023-08-30 07:11:35,280 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 07:11:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 07:11:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 07:11:35,282 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 07:11:35,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-08-30 07:11:35,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 07:11:35,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 07:11:35,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 07:11:35,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 07:11:35,568 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 07:11:35,568 INFO L350 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 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 07:11:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 07:11:35,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 07:11:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 07:11:38,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 07:11:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957580218] [2023-08-30 07:11:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957580218] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 07:11:38,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 07:11:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2023-08-30 07:11:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225940932] [2023-08-30 07:11:38,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 07:11:38,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 07:11:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 07:11:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 07:11:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2023-08-30 07:12:02,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 333 [2023-08-30 07:12:02,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 250 transitions, 2757 flow. Second operand has 31 states, 31 states have (on average 141.25806451612902) internal successors, (4379), 31 states have internal predecessors, (4379), 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-08-30 07:12:02,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 07:12:02,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 333 [2023-08-30 07:12:02,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15