./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8 --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:36:26,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:36:26,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:36:26,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:36:26,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:36:26,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:36:26,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:36:26,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:36:26,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:36:26,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:36:26,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:36:26,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:36:26,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:36:26,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:36:26,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:36:26,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:36:26,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:36:26,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:36:26,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:36:26,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:36:26,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:36:26,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:36:26,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:36:26,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:36:26,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:36:26,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:36:26,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:36:26,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:36:26,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:36:26,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:36:26,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:36:26,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:36:26,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:36:26,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:36:26,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:36:26,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:36:26,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:36:26,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:36:26,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:36:26,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:36:26,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:36:26,256 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:36:26,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:36:26,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:36:26,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:36:26,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:36:26,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:36:26,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:36:26,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:36:26,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:36:26,269 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:36:26,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:36:26,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:36:26,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:36:26,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:36:26,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:36:26,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:36:26,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:36:26,272 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:36:26,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:36:26,272 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:36:26,272 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8 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 [2022-12-13 12:36:26,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:36:26,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:36:26,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:36:26,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:36:26,464 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:36:26,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-13 12:36:29,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:36:29,191 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:36:29,191 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-13 12:36:29,196 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/443a28e18/17979c3d44754a5285fdc639e55a0205/FLAGa19948782 [2022-12-13 12:36:29,612 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/443a28e18/17979c3d44754a5285fdc639e55a0205 [2022-12-13 12:36:29,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:36:29,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:36:29,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:29,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:36:29,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:36:29,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:29" (1/1) ... [2022-12-13 12:36:29,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359cb96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:29, skipping insertion in model container [2022-12-13 12:36:29,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:29" (1/1) ... [2022-12-13 12:36:29,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:36:29,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:36:29,750 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-13 12:36:29,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:29,764 ERROR L326 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) [2022-12-13 12:36:29,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b8dcff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:29, skipping insertion in model container [2022-12-13 12:36:29,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:29,764 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 12:36:29,766 INFO L158 Benchmark]: Toolchain (without parser) took 150.13ms. Allocated memory is still 130.0MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:36:29,766 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:36:29,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.58ms. Allocated memory is still 130.0MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:36:29,767 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.13ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.58ms. Allocated memory is still 130.0MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). 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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8 --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:36:31,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:36:31,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:36:31,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:36:31,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:36:31,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:36:31,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:36:31,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:36:31,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:36:31,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:36:31,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:36:31,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:36:31,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:36:31,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:36:31,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:36:31,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:36:31,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:36:31,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:36:31,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:36:31,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:36:31,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:36:31,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:36:31,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:36:31,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:36:31,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:36:31,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:36:31,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:36:31,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:36:31,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:36:31,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:36:31,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:36:31,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:36:31,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:36:31,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:36:31,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:36:31,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:36:31,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:36:31,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:36:31,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:36:31,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:36:31,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:36:31,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 12:36:31,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:36:31,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:36:31,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:36:31,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:36:31,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:36:31,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:36:31,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:36:31,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:36:31,231 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:36:31,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:36:31,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:36:31,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:36:31,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:36:31,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:36:31,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:36:31,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:36:31,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:36:31,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:36:31,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:36:31,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:36:31,233 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:36:31,233 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:36:31,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:36:31,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:36:31,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:36:31,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:36:31,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:36:31,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:36:31,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:36:31,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:36:31,236 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:36:31,236 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:36:31,236 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8 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 [2022-12-13 12:36:31,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:36:31,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:36:31,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:36:31,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:36:31,459 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:36:31,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-13 12:36:34,029 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:36:34,170 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:36:34,170 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-13 12:36:34,176 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/ec2f3f865/838689e2728649fe8803a8482d0e3d56/FLAG76c9c281a [2022-12-13 12:36:34,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/data/ec2f3f865/838689e2728649fe8803a8482d0e3d56 [2022-12-13 12:36:34,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:36:34,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:36:34,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:34,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:36:34,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:36:34,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f27006a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34, skipping insertion in model container [2022-12-13 12:36:34,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:36:34,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:36:34,336 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-13 12:36:34,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:34,354 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 12:36:34,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:36:34,365 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-13 12:36:34,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:34,372 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:36:34,387 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-13 12:36:34,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:34,402 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:36:34,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34 WrapperNode [2022-12-13 12:36:34,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:34,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:36:34,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:36:34,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:36:34,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,431 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2022-12-13 12:36:34,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:36:34,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:36:34,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:36:34,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:36:34,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:36:34,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:36:34,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:36:34,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:36:34,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (1/1) ... [2022-12-13 12:36:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:36:34,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:36:34,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:36:34,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:36:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:36:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:36:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:36:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 12:36:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:36:34,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:36:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:36:34,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:36:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 12:36:34,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 12:36:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:36:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:36:34,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:36:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:36:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 12:36:34,540 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 12:36:34,628 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:36:34,630 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:36:34,983 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:36:34,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:36:34,991 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 12:36:34,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:34 BoogieIcfgContainer [2022-12-13 12:36:34,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:36:34,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:36:34,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:36:34,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:36:34,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:36:34" (1/3) ... [2022-12-13 12:36:35,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94f95a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:34, skipping insertion in model container [2022-12-13 12:36:35,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:34" (2/3) ... [2022-12-13 12:36:35,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94f95a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:35, skipping insertion in model container [2022-12-13 12:36:35,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:34" (3/3) ... [2022-12-13 12:36:35,002 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-12-13 12:36:35,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:36:35,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-12-13 12:36:35,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:36:35,093 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 12:36:35,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 181 transitions, 386 flow [2022-12-13 12:36:35,168 INFO L130 PetriNetUnfolder]: 12/178 cut-off events. [2022-12-13 12:36:35,169 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:36:35,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 178 events. 12/178 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 195 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2022-12-13 12:36:35,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 181 transitions, 386 flow [2022-12-13 12:36:35,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 173 transitions, 364 flow [2022-12-13 12:36:35,180 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:36:35,187 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 173 transitions, 364 flow [2022-12-13 12:36:35,189 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 173 transitions, 364 flow [2022-12-13 12:36:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 173 transitions, 364 flow [2022-12-13 12:36:35,214 INFO L130 PetriNetUnfolder]: 12/173 cut-off events. [2022-12-13 12:36:35,214 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:36:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 12/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2022-12-13 12:36:35,217 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2022-12-13 12:36:49,857 INFO L134 LiptonReduction]: Checked pairs total: 3177 [2022-12-13 12:36:49,858 INFO L136 LiptonReduction]: Total number of compositions: 174 [2022-12-13 12:36:49,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:36:49,872 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;@6fa25ab0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:36:49,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-12-13 12:36:49,874 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-12-13 12:36:49,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:49,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:49,875 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 12:36:49,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 21173, now seen corresponding path program 1 times [2022-12-13 12:36:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777983581] [2022-12-13 12:36:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:49,887 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 [2022-12-13 12:36:49,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:49,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:49,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:49,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:36:49,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:50,057 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-12-13 12:36:50,058 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 [2022-12-13 12:36:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:50,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:50,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:50,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777983581] [2022-12-13 12:36:50,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777983581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:50,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:50,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123965081] [2022-12-13 12:36:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:50,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 355 [2022-12-13 12:36:50,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 108 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) [2022-12-13 12:36:50,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:50,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 355 [2022-12-13 12:36:50,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:50,646 INFO L130 PetriNetUnfolder]: 2717/3464 cut-off events. [2022-12-13 12:36:50,646 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 12:36:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 3464 events. 2717/3464 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 14130 event pairs, 1294 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 5996. Up to 3434 conditions per place. [2022-12-13 12:36:50,663 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2022-12-13 12:36:50,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 184 flow [2022-12-13 12:36:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2022-12-13 12:36:50,674 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48732394366197185 [2022-12-13 12:36:50,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2022-12-13 12:36:50,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2022-12-13 12:36:50,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:50,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2022-12-13 12:36:50,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:50,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:50,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:50,687 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 108 flow. Second operand 3 states and 519 transitions. [2022-12-13 12:36:50,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 184 flow [2022-12-13 12:36:50,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 12:36:50,699 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2022-12-13 12:36:50,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:36:50,704 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 12:36:50,704 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2022-12-13 12:36:50,705 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) [2022-12-13 12:36:50,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:50,705 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 12:36:50,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:50,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:50,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 21174, now seen corresponding path program 1 times [2022-12-13 12:36:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:50,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421805023] [2022-12-13 12:36:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:50,908 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 [2022-12-13 12:36:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:50,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:50,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:50,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 12:36:50,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:51,078 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:36:51,078 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 [2022-12-13 12:36:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:51,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:51,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:51,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421805023] [2022-12-13 12:36:51,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421805023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:51,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:51,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443187560] [2022-12-13 12:36:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:51,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:51,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:51,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 355 [2022-12-13 12:36:51,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 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) [2022-12-13 12:36:51,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:51,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 355 [2022-12-13 12:36:51,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:52,135 INFO L130 PetriNetUnfolder]: 5423/6916 cut-off events. [2022-12-13 12:36:52,135 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 12:36:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 6916 events. 5423/6916 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 31087 event pairs, 2585 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 13831. Up to 3432 conditions per place. [2022-12-13 12:36:52,164 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 76 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2022-12-13 12:36:52,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 332 flow [2022-12-13 12:36:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2022-12-13 12:36:52,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5220657276995305 [2022-12-13 12:36:52,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2022-12-13 12:36:52,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2022-12-13 12:36:52,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:52,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2022-12-13 12:36:52,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:52,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:52,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:52,179 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 556 transitions. [2022-12-13 12:36:52,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 332 flow [2022-12-13 12:36:52,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:52,180 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 105 flow [2022-12-13 12:36:52,180 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 12:36:52,181 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-13 12:36:52,181 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 105 flow [2022-12-13 12:36:52,181 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) [2022-12-13 12:36:52,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:52,182 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 12:36:52,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:36:52,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:52,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 21273, now seen corresponding path program 1 times [2022-12-13 12:36:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:52,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043699414] [2022-12-13 12:36:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:52,383 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 [2022-12-13 12:36:52,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:52,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:52,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:52,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:36:52,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:52,512 INFO L321 Elim1Store]: treesize reduction 115, result has 16.1 percent of original size [2022-12-13 12:36:52,512 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 47 [2022-12-13 12:36:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:52,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:52,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:52,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043699414] [2022-12-13 12:36:52,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043699414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:52,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:52,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801199048] [2022-12-13 12:36:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:52,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:52,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:52,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 355 [2022-12-13 12:36:52,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 105 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) [2022-12-13 12:36:52,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:52,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 355 [2022-12-13 12:36:52,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:53,331 INFO L130 PetriNetUnfolder]: 4283/5524 cut-off events. [2022-12-13 12:36:53,331 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 12:36:53,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 5524 events. 4283/5524 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 24912 event pairs, 2038 based on Foata normal form. 0/1545 useless extension candidates. Maximal degree in co-relation 11052. Up to 5464 conditions per place. [2022-12-13 12:36:53,352 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 38 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2022-12-13 12:36:53,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 179 flow [2022-12-13 12:36:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-12-13 12:36:53,355 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48544600938967136 [2022-12-13 12:36:53,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2022-12-13 12:36:53,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2022-12-13 12:36:53,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:53,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2022-12-13 12:36:53,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:53,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:53,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:53,360 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 105 flow. Second operand 3 states and 517 transitions. [2022-12-13 12:36:53,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 179 flow [2022-12-13 12:36:53,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:53,362 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 101 flow [2022-12-13 12:36:53,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 12:36:53,363 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-13 12:36:53,363 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 101 flow [2022-12-13 12:36:53,363 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) [2022-12-13 12:36:53,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:53,364 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 12:36:53,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:36:53,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:53,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 21275, now seen corresponding path program 1 times [2022-12-13 12:36:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:53,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262571233] [2022-12-13 12:36:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:53,569 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 [2022-12-13 12:36:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:53,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:53,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:53,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:36:53,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:53,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:53,764 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 12:36:53,765 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 29 [2022-12-13 12:36:53,786 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 12:36:53,786 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 23 treesize of output 19 [2022-12-13 12:36:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:53,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:53,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262571233] [2022-12-13 12:36:53,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262571233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:53,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:53,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535038431] [2022-12-13 12:36:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:54,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 355 [2022-12-13 12:36:54,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 101 flow. Second operand has 3 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) [2022-12-13 12:36:54,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:54,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 355 [2022-12-13 12:36:54,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:54,384 INFO L130 PetriNetUnfolder]: 3133/4122 cut-off events. [2022-12-13 12:36:54,384 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 12:36:54,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 4122 events. 3133/4122 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 18602 event pairs, 1488 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 8247. Up to 4062 conditions per place. [2022-12-13 12:36:54,397 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 36 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-12-13 12:36:54,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 171 flow [2022-12-13 12:36:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-12-13 12:36:54,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4863849765258216 [2022-12-13 12:36:54,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-12-13 12:36:54,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-12-13 12:36:54,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:54,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-12-13 12:36:54,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:54,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:54,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:54,402 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 101 flow. Second operand 3 states and 518 transitions. [2022-12-13 12:36:54,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 171 flow [2022-12-13 12:36:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:54,403 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 98 flow [2022-12-13 12:36:54,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-13 12:36:54,404 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 12:36:54,404 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 98 flow [2022-12-13 12:36:54,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-12-13 12:36:54,404 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:54,404 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:36:54,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:54,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 658875, now seen corresponding path program 1 times [2022-12-13 12:36:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:54,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787124748] [2022-12-13 12:36:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:54,610 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 [2022-12-13 12:36:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:54,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:54,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:54,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 12:36:54,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:54,820 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:36:54,820 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 [2022-12-13 12:36:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:54,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:36:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:55,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787124748] [2022-12-13 12:36:55,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787124748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:36:55,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:36:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2022-12-13 12:36:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092811125] [2022-12-13 12:36:55,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:36:55,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:36:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:36:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:36:56,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 355 [2022-12-13 12:36:56,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:56,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:56,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 355 [2022-12-13 12:36:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:56,840 INFO L130 PetriNetUnfolder]: 4681/6166 cut-off events. [2022-12-13 12:36:56,840 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 12:36:56,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12347 conditions, 6166 events. 4681/6166 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 29450 event pairs, 2226 based on Foata normal form. 0/1998 useless extension candidates. Maximal degree in co-relation 12337. Up to 2030 conditions per place. [2022-12-13 12:36:56,856 INFO L137 encePairwiseOnDemand]: 351/355 looper letters, 101 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2022-12-13 12:36:56,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 111 transitions, 474 flow [2022-12-13 12:36:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:36:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:36:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1035 transitions. [2022-12-13 12:36:56,858 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4859154929577465 [2022-12-13 12:36:56,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1035 transitions. [2022-12-13 12:36:56,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1035 transitions. [2022-12-13 12:36:56,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:56,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1035 transitions. [2022-12-13 12:36:56,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:56,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:56,863 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:56,863 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 98 flow. Second operand 6 states and 1035 transitions. [2022-12-13 12:36:56,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 111 transitions, 474 flow [2022-12-13 12:36:56,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:56,865 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 151 flow [2022-12-13 12:36:56,865 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:36:56,865 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-12-13 12:36:56,865 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 151 flow [2022-12-13 12:36:56,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:56,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:56,866 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:36:56,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:57,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 20459048, now seen corresponding path program 1 times [2022-12-13 12:36:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:57,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170748169] [2022-12-13 12:36:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:57,067 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 [2022-12-13 12:36:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:57,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:57,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:57,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:36:57,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:57,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:57,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:36:57,216 INFO L321 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2022-12-13 12:36:57,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 35 [2022-12-13 12:36:57,229 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 42 treesize of output 38 [2022-12-13 12:36:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:57,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:57,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170748169] [2022-12-13 12:36:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170748169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:57,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:57,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626445926] [2022-12-13 12:36:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:57,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:57,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 355 [2022-12-13 12:36:57,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:57,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:57,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 355 [2022-12-13 12:36:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:57,916 INFO L130 PetriNetUnfolder]: 4440/5835 cut-off events. [2022-12-13 12:36:57,916 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 12:36:57,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11713 conditions, 5835 events. 4440/5835 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 27781 event pairs, 2103 based on Foata normal form. 0/1884 useless extension candidates. Maximal degree in co-relation 11698. Up to 5745 conditions per place. [2022-12-13 12:36:57,935 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2022-12-13 12:36:57,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 227 flow [2022-12-13 12:36:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2022-12-13 12:36:57,937 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48450704225352115 [2022-12-13 12:36:57,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2022-12-13 12:36:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2022-12-13 12:36:57,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:57,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2022-12-13 12:36:57,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:57,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:57,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:57,939 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 151 flow. Second operand 3 states and 516 transitions. [2022-12-13 12:36:57,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 227 flow [2022-12-13 12:36:57,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 217 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:57,941 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 139 flow [2022-12-13 12:36:57,941 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:36:57,941 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2022-12-13 12:36:57,941 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 139 flow [2022-12-13 12:36:57,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:57,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:57,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:36:57,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:36:58,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:58,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 20459047, now seen corresponding path program 1 times [2022-12-13 12:36:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984229291] [2022-12-13 12:36:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:58,144 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 [2022-12-13 12:36:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:58,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:58,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:58,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:36:58,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:58,283 INFO L321 Elim1Store]: treesize reduction 101, result has 20.5 percent of original size [2022-12-13 12:36:58,283 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 44 [2022-12-13 12:36:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:58,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:58,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:58,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984229291] [2022-12-13 12:36:58,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984229291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:58,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:58,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035720634] [2022-12-13 12:36:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:58,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:58,414 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 355 [2022-12-13 12:36:58,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:58,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:58,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 355 [2022-12-13 12:36:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:58,838 INFO L130 PetriNetUnfolder]: 4179/5484 cut-off events. [2022-12-13 12:36:58,838 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 12:36:58,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11008 conditions, 5484 events. 4179/5484 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 25788 event pairs, 1974 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 10992. Up to 5394 conditions per place. [2022-12-13 12:36:58,853 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2022-12-13 12:36:58,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 211 flow [2022-12-13 12:36:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-12-13 12:36:58,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47136150234741786 [2022-12-13 12:36:58,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-12-13 12:36:58,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-12-13 12:36:58,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:58,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-12-13 12:36:58,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:58,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:58,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:58,857 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 139 flow. Second operand 3 states and 502 transitions. [2022-12-13 12:36:58,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 211 flow [2022-12-13 12:36:58,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:58,858 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 136 flow [2022-12-13 12:36:58,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:36:58,859 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 12:36:58,859 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 136 flow [2022-12-13 12:36:58,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:58,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:58,859 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:36:58,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:36:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:59,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash 634225168, now seen corresponding path program 1 times [2022-12-13 12:36:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179323998] [2022-12-13 12:36:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:59,061 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 [2022-12-13 12:36:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:59,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:59,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:59,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:36:59,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:36:59,178 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-12-13 12:36:59,178 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 [2022-12-13 12:36:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:59,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:36:59,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:36:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179323998] [2022-12-13 12:36:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179323998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:36:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42163456] [2022-12-13 12:36:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:59,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:36:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:36:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:36:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:36:59,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 355 [2022-12-13 12:36:59,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:59,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 355 [2022-12-13 12:36:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:59,637 INFO L130 PetriNetUnfolder]: 2163/2922 cut-off events. [2022-12-13 12:36:59,637 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 12:36:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5885 conditions, 2922 events. 2163/2922 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13137 event pairs, 1002 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 5868. Up to 2855 conditions per place. [2022-12-13 12:36:59,646 INFO L137 encePairwiseOnDemand]: 350/355 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-13 12:36:59,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 200 flow [2022-12-13 12:36:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:36:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:36:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2022-12-13 12:36:59,648 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.447887323943662 [2022-12-13 12:36:59,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2022-12-13 12:36:59,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2022-12-13 12:36:59,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:59,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2022-12-13 12:36:59,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 355.0) internal successors, (1775), 5 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 355.0) internal successors, (1775), 5 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,651 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 136 flow. Second operand 4 states and 636 transitions. [2022-12-13 12:36:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 200 flow [2022-12-13 12:36:59,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:59,652 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 137 flow [2022-12-13 12:36:59,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:36:59,652 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-12-13 12:36:59,652 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 137 flow [2022-12-13 12:36:59,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,652 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:59,653 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:36:59,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:36:59,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:59,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:36:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 634225166, now seen corresponding path program 1 times [2022-12-13 12:36:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:36:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611343293] [2022-12-13 12:36:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:59,854 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 [2022-12-13 12:36:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:36:59,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:36:59,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:36:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:59,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 12:36:59,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:00,000 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:00,000 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 [2022-12-13 12:37:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:00,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:00,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611343293] [2022-12-13 12:37:00,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611343293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:00,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:00,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:37:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517152227] [2022-12-13 12:37:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:00,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:37:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:37:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:00,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 355 [2022-12-13 12:37:00,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:00,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:00,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 355 [2022-12-13 12:37:00,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:01,037 INFO L130 PetriNetUnfolder]: 3192/4401 cut-off events. [2022-12-13 12:37:01,037 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 12:37:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8885 conditions, 4401 events. 3192/4401 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 21992 event pairs, 1029 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 8867. Up to 2621 conditions per place. [2022-12-13 12:37:01,050 INFO L137 encePairwiseOnDemand]: 350/355 looper letters, 53 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2022-12-13 12:37:01,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 306 flow [2022-12-13 12:37:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:37:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 824 transitions. [2022-12-13 12:37:01,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46422535211267607 [2022-12-13 12:37:01,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 824 transitions. [2022-12-13 12:37:01,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 824 transitions. [2022-12-13 12:37:01,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:01,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 824 transitions. [2022-12-13 12:37:01,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,055 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 137 flow. Second operand 5 states and 824 transitions. [2022-12-13 12:37:01,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 306 flow [2022-12-13 12:37:01,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:37:01,056 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 152 flow [2022-12-13 12:37:01,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:37:01,057 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-12-13 12:37:01,057 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 152 flow [2022-12-13 12:37:01,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:01,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:37:01,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:01,259 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1813678596, now seen corresponding path program 1 times [2022-12-13 12:37:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834728178] [2022-12-13 12:37:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:01,261 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 [2022-12-13 12:37:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:01,264 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:01,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:01,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 12:37:01,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:01,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:37:01,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:37:01,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:37:01,423 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 12:37:01,423 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 [2022-12-13 12:37:01,431 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 [2022-12-13 12:37:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:01,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:01,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:01,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834728178] [2022-12-13 12:37:01,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834728178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:01,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:01,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:37:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139368523] [2022-12-13 12:37:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:01,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:37:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:37:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:37:01,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 355 [2022-12-13 12:37:01,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 152 flow. Second operand has 3 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) [2022-12-13 12:37:01,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:01,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 355 [2022-12-13 12:37:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:01,887 INFO L130 PetriNetUnfolder]: 2469/3447 cut-off events. [2022-12-13 12:37:01,887 INFO L131 PetriNetUnfolder]: For 280/397 co-relation queries the response was YES. [2022-12-13 12:37:01,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7445 conditions, 3447 events. 2469/3447 cut-off events. For 280/397 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 17001 event pairs, 1329 based on Foata normal form. 117/1899 useless extension candidates. Maximal degree in co-relation 7426. Up to 3375 conditions per place. [2022-12-13 12:37:01,897 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 33 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2022-12-13 12:37:01,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 216 flow [2022-12-13 12:37:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:37:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:37:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2022-12-13 12:37:01,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4779342723004695 [2022-12-13 12:37:01,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2022-12-13 12:37:01,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2022-12-13 12:37:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:01,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2022-12-13 12:37:01,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,901 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 152 flow. Second operand 3 states and 509 transitions. [2022-12-13 12:37:01,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 216 flow [2022-12-13 12:37:01,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 206 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:01,902 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 140 flow [2022-12-13 12:37:01,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 12:37:01,903 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-12-13 12:37:01,903 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 140 flow [2022-12-13 12:37:01,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-12-13 12:37:01,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:01,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:37:01,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,105 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1813678595, now seen corresponding path program 1 times [2022-12-13 12:37:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:02,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389719618] [2022-12-13 12:37:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:02,107 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 [2022-12-13 12:37:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:02,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:02,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:02,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 12:37:02,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:02,249 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-12-13 12:37:02,250 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 29 [2022-12-13 12:37:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:02,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:02,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:02,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389719618] [2022-12-13 12:37:02,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389719618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:02,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:02,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:37:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014047881] [2022-12-13 12:37:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:37:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:37:02,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:37:02,365 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 355 [2022-12-13 12:37:02,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:02,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:02,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 355 [2022-12-13 12:37:02,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:02,659 INFO L130 PetriNetUnfolder]: 2283/3177 cut-off events. [2022-12-13 12:37:02,659 INFO L131 PetriNetUnfolder]: For 250/358 co-relation queries the response was YES. [2022-12-13 12:37:02,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 3177 events. 2283/3177 cut-off events. For 250/358 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 15461 event pairs, 1224 based on Foata normal form. 108/1803 useless extension candidates. Maximal degree in co-relation 6719. Up to 3102 conditions per place. [2022-12-13 12:37:02,669 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 31 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-12-13 12:37:02,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 200 flow [2022-12-13 12:37:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:37:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:37:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-12-13 12:37:02,670 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4647887323943662 [2022-12-13 12:37:02,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2022-12-13 12:37:02,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2022-12-13 12:37:02,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:02,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2022-12-13 12:37:02,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:02,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:02,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:02,672 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 140 flow. Second operand 3 states and 495 transitions. [2022-12-13 12:37:02,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 200 flow [2022-12-13 12:37:02,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 35 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:37:02,673 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 137 flow [2022-12-13 12:37:02,674 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-12-13 12:37:02,674 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 12:37:02,674 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 137 flow [2022-12-13 12:37:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:02,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:02,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:37:02,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1813851426, now seen corresponding path program 1 times [2022-12-13 12:37:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:02,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343854541] [2022-12-13 12:37:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:02,878 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 [2022-12-13 12:37:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:02,881 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:02,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:02,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 12:37:02,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:03,062 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:03,062 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 [2022-12-13 12:37:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:03,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:03,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:03,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343854541] [2022-12-13 12:37:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343854541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:03,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:03,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:37:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063035374] [2022-12-13 12:37:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:03,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:37:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:37:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:03,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 355 [2022-12-13 12:37:03,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:03,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:03,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 355 [2022-12-13 12:37:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:03,950 INFO L130 PetriNetUnfolder]: 1877/2666 cut-off events. [2022-12-13 12:37:03,950 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 12:37:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5713 conditions, 2666 events. 1877/2666 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 12660 event pairs, 1034 based on Foata normal form. 26/1571 useless extension candidates. Maximal degree in co-relation 5693. Up to 2361 conditions per place. [2022-12-13 12:37:03,958 INFO L137 encePairwiseOnDemand]: 348/355 looper letters, 57 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-13 12:37:03,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 330 flow [2022-12-13 12:37:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:37:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 815 transitions. [2022-12-13 12:37:03,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4591549295774648 [2022-12-13 12:37:03,960 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 815 transitions. [2022-12-13 12:37:03,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 815 transitions. [2022-12-13 12:37:03,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:03,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 815 transitions. [2022-12-13 12:37:03,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:03,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:03,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:03,963 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 137 flow. Second operand 5 states and 815 transitions. [2022-12-13 12:37:03,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 330 flow [2022-12-13 12:37:03,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:37:03,964 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 175 flow [2022-12-13 12:37:03,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2022-12-13 12:37:03,965 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-13 12:37:03,965 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 175 flow [2022-12-13 12:37:03,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:03,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:03,966 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2022-12-13 12:37:03,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:04,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:04,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1843827722, now seen corresponding path program 2 times [2022-12-13 12:37:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913929720] [2022-12-13 12:37:04,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:37:04,171 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 [2022-12-13 12:37:04,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:04,173 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:04,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:37:04,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:37:04,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:37:04,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:04,345 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:04,345 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 [2022-12-13 12:37:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:04,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:05,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:05,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913929720] [2022-12-13 12:37:05,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913929720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:05,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:05,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2022-12-13 12:37:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436462584] [2022-12-13 12:37:05,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:05,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:37:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:37:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:37:08,724 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 355 [2022-12-13 12:37:08,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 175 flow. Second operand has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:08,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:08,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 355 [2022-12-13 12:37:08,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:11,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][42], [75#L84-4true, 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 194#(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: 211#true, Black: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 230#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 379#(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))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,169 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,169 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,169 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,169 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-13 12:37:11,170 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][42], [75#L84-4true, 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 194#(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: 211#true, Black: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 230#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 279#(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))), 379#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,170 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,170 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,170 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-13 12:37:11,171 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][42], [220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 194#(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: 211#true, 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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: 230#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 64#L85-1true, 379#(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))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,368 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][42], [220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 194#(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: 211#true, 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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: 230#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 64#L85-1true, 279#(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))), 379#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,369 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,369 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,370 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][59], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 383#(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))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,375 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,376 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,376 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,376 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][59], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 383#(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))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,376 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,376 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 12:37:11,377 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,377 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][59], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 383#(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))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,609 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,609 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,609 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,609 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][59], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 383#(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))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,610 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,610 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,610 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,610 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][83], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), 387#(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))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,619 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][83], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 387#(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))), Black: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,620 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,620 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 12:37:11,620 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,620 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,847 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][83], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), 387#(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))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,847 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][83], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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: 224#(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|)))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), 387#(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))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,848 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][107], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 391#(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 |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,890 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][107], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 391#(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 |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:11,891 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,891 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:11,891 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 12:37:11,891 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:12,026 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][120], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 413#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,026 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,026 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,026 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:12,026 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,027 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][120], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 413#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,027 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,027 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,027 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,027 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:12,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][107], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 391#(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 |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,075 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,075 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,075 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:12,075 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][107], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 391#(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 |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,076 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:37:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][139], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 415#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,171 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,171 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,171 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,171 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][139], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 415#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,172 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,172 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,172 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,172 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][120], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 413#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,183 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,183 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,183 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,183 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][120], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 413#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,184 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,184 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:37:12,184 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,184 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][156], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 417#(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 (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 (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 (_ 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|)))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,278 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,278 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,278 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,278 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][156], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 417#(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 (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 (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 (_ 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|)))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,279 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,279 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,279 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,279 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][139], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 415#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,298 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,298 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,298 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,298 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,299 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][139], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 415#(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 (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 (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 (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,299 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,299 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:37:12,299 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,299 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,418 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][170], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 419#(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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,418 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,418 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,418 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,418 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][170], [75#L84-4true, Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 419#(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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,419 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,419 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,419 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,419 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,426 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][156], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 417#(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 (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 (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 (_ 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|)))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,427 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][156], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 158#thread3EXITtrue, Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 417#(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 (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 (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 (_ 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|)))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,427 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:37:12,427 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,553 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][183], [75#L84-4true, 395#(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: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,553 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][183], [75#L84-4true, 395#(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: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,554 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,554 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,555 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][170], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 419#(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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,562 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,562 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,562 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,562 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,563 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][170], [Black: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 419#(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 (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,563 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,563 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:37:12,563 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,563 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][183], [395#(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: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 165#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,649 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,649 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,649 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,649 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([616] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul v_thread2Thread1of1ForFork0_~i~1_36 (_ bv4 32)))) (let ((.cse0 (bvadd v_~A~0.offset_41 (_ bv4 32) .cse3)) (.cse1 (bvadd v_~A~0.offset_41 .cse3))) (and (bvule .cse0 (select |v_#length_135| v_~A~0.base_50)) (= (_ bv0 1) (bvadd (select |v_#valid_186| v_~A~0.base_50) (_ bv1 1))) (bvule .cse1 .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int_73| v_~A~0.base_50))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_41 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_41 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_41 .cse3 (_ bv1 32)))) (select .cse2 .cse1))) v_~sum2~0_28) v_~sum2~0_27) (= v_thread2Thread1of1ForFork0_~i~1_35 (bvadd v_thread2Thread1of1ForFork0_~i~1_36 (_ bv1 32))) (bvslt v_thread2Thread1of1ForFork0_~i~1_36 v_~M~0_41)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_36, ~A~0.base=v_~A~0.base_50, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_28, #length=|v_#length_135|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_35, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_19|, ~A~0.offset=v_~A~0.offset_41, ~M~0=v_~M~0_41, #valid=|v_#valid_186|, #memory_int=|v_#memory_int_73|, ~sum2~0=v_~sum2~0_27, #length=|v_#length_135|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, ~sum2~0, thread2Thread1of1ForFork0_#t~mem4][183], [395#(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: 194#(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: 211#true, Black: 220#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (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))), 328#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))), Black: 224#(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|)))), 254#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))), 187#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)), 209#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 365#(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|)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (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))), 158#thread3EXITtrue, Black: 347#(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: 363#(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))), 15#L48-5true, 241#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 309#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), 301#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)) (= (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))), 76#L56-5true, 64#L85-1true, 230#(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|)))), 279#(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))), 202#(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)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~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|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 342#true]) [2022-12-13 12:37:12,650 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,650 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:37:12,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:37:12,913 INFO L130 PetriNetUnfolder]: 8186/11274 cut-off events. [2022-12-13 12:37:12,913 INFO L131 PetriNetUnfolder]: For 7894/8237 co-relation queries the response was YES. [2022-12-13 12:37:12,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29387 conditions, 11274 events. 8186/11274 cut-off events. For 7894/8237 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 61851 event pairs, 4206 based on Foata normal form. 346/8890 useless extension candidates. Maximal degree in co-relation 29363. Up to 3007 conditions per place. [2022-12-13 12:37:12,947 INFO L137 encePairwiseOnDemand]: 351/355 looper letters, 227 selfloop transitions, 12 changer transitions 0/243 dead transitions. [2022-12-13 12:37:12,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 243 transitions, 1308 flow [2022-12-13 12:37:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:37:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 12:37:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2096 transitions. [2022-12-13 12:37:12,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.492018779342723 [2022-12-13 12:37:12,952 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2096 transitions. [2022-12-13 12:37:12,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2096 transitions. [2022-12-13 12:37:12,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:12,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2096 transitions. [2022-12-13 12:37:12,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 174.66666666666666) internal successors, (2096), 12 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,958 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,958 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 175 flow. Second operand 12 states and 2096 transitions. [2022-12-13 12:37:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 243 transitions, 1308 flow [2022-12-13 12:37:12,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 243 transitions, 1298 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 12:37:12,962 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 264 flow [2022-12-13 12:37:12,963 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=264, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2022-12-13 12:37:12,963 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2022-12-13 12:37:12,963 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 264 flow [2022-12-13 12:37:12,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,964 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:12,964 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:12,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:13,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1294105757, now seen corresponding path program 1 times [2022-12-13 12:37:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:13,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058754663] [2022-12-13 12:37:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:13,168 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 [2022-12-13 12:37:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:13,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:13,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:13,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 12:37:13,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:13,386 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:13,386 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 [2022-12-13 12:37:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:37:13,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:37:13,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:13,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058754663] [2022-12-13 12:37:13,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058754663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:13,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:13,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-12-13 12:37:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276266260] [2022-12-13 12:37:13,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:37:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:37:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:37:15,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 355 [2022-12-13 12:37:15,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 152.4) internal successors, (1524), 10 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:15,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:15,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 355 [2022-12-13 12:37:15,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:18,558 INFO L130 PetriNetUnfolder]: 15386/20430 cut-off events. [2022-12-13 12:37:18,559 INFO L131 PetriNetUnfolder]: For 12208/12258 co-relation queries the response was YES. [2022-12-13 12:37:18,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52893 conditions, 20430 events. 15386/20430 cut-off events. For 12208/12258 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 113000 event pairs, 1884 based on Foata normal form. 4/15812 useless extension candidates. Maximal degree in co-relation 52862. Up to 5229 conditions per place. [2022-12-13 12:37:18,662 INFO L137 encePairwiseOnDemand]: 349/355 looper letters, 91 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2022-12-13 12:37:18,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 652 flow [2022-12-13 12:37:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:37:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:37:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1301 transitions. [2022-12-13 12:37:18,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4580985915492958 [2022-12-13 12:37:18,667 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1301 transitions. [2022-12-13 12:37:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1301 transitions. [2022-12-13 12:37:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:18,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1301 transitions. [2022-12-13 12:37:18,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.625) internal successors, (1301), 8 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:18,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 355.0) internal successors, (3195), 9 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:18,673 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 355.0) internal successors, (3195), 9 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:18,673 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 264 flow. Second operand 8 states and 1301 transitions. [2022-12-13 12:37:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 652 flow [2022-12-13 12:37:18,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 107 transitions, 627 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 12:37:18,678 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 313 flow [2022-12-13 12:37:18,679 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2022-12-13 12:37:18,679 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2022-12-13 12:37:18,679 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 313 flow [2022-12-13 12:37:18,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 152.4) internal successors, (1524), 10 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:18,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:18,680 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:18,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:18,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:18,881 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash -389466663, now seen corresponding path program 1 times [2022-12-13 12:37:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:18,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778260789] [2022-12-13 12:37:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:18,883 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 [2022-12-13 12:37:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:18,884 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:18,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:18,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 12:37:18,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:19,058 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:19,059 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 [2022-12-13 12:37:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:19,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:19,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:19,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778260789] [2022-12-13 12:37:19,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778260789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:19,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:19,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:37:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928505134] [2022-12-13 12:37:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:19,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:37:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:19,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:37:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:19,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 355 [2022-12-13 12:37:19,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 49 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:19,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:19,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 355 [2022-12-13 12:37:19,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:22,564 INFO L130 PetriNetUnfolder]: 19940/27324 cut-off events. [2022-12-13 12:37:22,564 INFO L131 PetriNetUnfolder]: For 43239/44676 co-relation queries the response was YES. [2022-12-13 12:37:22,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83305 conditions, 27324 events. 19940/27324 cut-off events. For 43239/44676 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 167911 event pairs, 8099 based on Foata normal form. 1436/24364 useless extension candidates. Maximal degree in co-relation 83269. Up to 17928 conditions per place. [2022-12-13 12:37:22,704 INFO L137 encePairwiseOnDemand]: 350/355 looper letters, 61 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2022-12-13 12:37:22,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 72 transitions, 558 flow [2022-12-13 12:37:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:37:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 809 transitions. [2022-12-13 12:37:22,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45577464788732397 [2022-12-13 12:37:22,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 809 transitions. [2022-12-13 12:37:22,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 809 transitions. [2022-12-13 12:37:22,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:22,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 809 transitions. [2022-12-13 12:37:22,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:22,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:22,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:22,710 INFO L175 Difference]: Start difference. First operand has 78 places, 49 transitions, 313 flow. Second operand 5 states and 809 transitions. [2022-12-13 12:37:22,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 72 transitions, 558 flow [2022-12-13 12:37:22,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 531 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:22,739 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 323 flow [2022-12-13 12:37:22,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2022-12-13 12:37:22,740 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2022-12-13 12:37:22,740 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 323 flow [2022-12-13 12:37:22,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:22,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:22,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:22,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:22,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:22,941 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -610045336, now seen corresponding path program 1 times [2022-12-13 12:37:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:22,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066294811] [2022-12-13 12:37:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:22,944 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 [2022-12-13 12:37:22,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:22,946 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:22,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:23,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 12:37:23,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:23,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:23,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:23,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066294811] [2022-12-13 12:37:23,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066294811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:23,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:23,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:37:23,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339869329] [2022-12-13 12:37:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:23,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:37:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:37:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:23,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 355 [2022-12-13 12:37:23,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:23,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:23,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 355 [2022-12-13 12:37:23,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:25,668 INFO L130 PetriNetUnfolder]: 14963/21281 cut-off events. [2022-12-13 12:37:25,668 INFO L131 PetriNetUnfolder]: For 44055/47600 co-relation queries the response was YES. [2022-12-13 12:37:25,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68397 conditions, 21281 events. 14963/21281 cut-off events. For 44055/47600 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 128153 event pairs, 10718 based on Foata normal form. 3545/23287 useless extension candidates. Maximal degree in co-relation 68360. Up to 21110 conditions per place. [2022-12-13 12:37:25,767 INFO L137 encePairwiseOnDemand]: 350/355 looper letters, 66 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2022-12-13 12:37:25,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 525 flow [2022-12-13 12:37:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:37:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2022-12-13 12:37:25,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4687323943661972 [2022-12-13 12:37:25,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2022-12-13 12:37:25,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2022-12-13 12:37:25,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:25,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2022-12-13 12:37:25,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,773 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 323 flow. Second operand 5 states and 832 transitions. [2022-12-13 12:37:25,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 525 flow [2022-12-13 12:37:25,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 511 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:25,790 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 326 flow [2022-12-13 12:37:25,790 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:37:25,791 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2022-12-13 12:37:25,791 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 326 flow [2022-12-13 12:37:25,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:25,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:25,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:25,992 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2070820584, now seen corresponding path program 1 times [2022-12-13 12:37:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612025836] [2022-12-13 12:37:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:25,995 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 [2022-12-13 12:37:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:25,997 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:25,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:26,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:37:26,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:26,163 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:26,163 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 [2022-12-13 12:37:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:37:26,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:37:26,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:26,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612025836] [2022-12-13 12:37:26,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612025836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:26,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:26,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-12-13 12:37:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37665542] [2022-12-13 12:37:26,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:37:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:37:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:37:29,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 355 [2022-12-13 12:37:29,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 150.8) internal successors, (1508), 10 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:29,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:29,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 355 [2022-12-13 12:37:29,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:35,217 INFO L130 PetriNetUnfolder]: 34506/46586 cut-off events. [2022-12-13 12:37:35,217 INFO L131 PetriNetUnfolder]: For 63986/64952 co-relation queries the response was YES. [2022-12-13 12:37:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150866 conditions, 46586 events. 34506/46586 cut-off events. For 63986/64952 co-relation queries the response was YES. Maximal size of possible extension queue 1949. Compared 292049 event pairs, 5050 based on Foata normal form. 4241/50258 useless extension candidates. Maximal degree in co-relation 150827. Up to 12516 conditions per place. [2022-12-13 12:37:35,542 INFO L137 encePairwiseOnDemand]: 349/355 looper letters, 117 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2022-12-13 12:37:35,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 966 flow [2022-12-13 12:37:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:37:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:37:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1281 transitions. [2022-12-13 12:37:35,545 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.451056338028169 [2022-12-13 12:37:35,545 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1281 transitions. [2022-12-13 12:37:35,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1281 transitions. [2022-12-13 12:37:35,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:35,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1281 transitions. [2022-12-13 12:37:35,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 160.125) internal successors, (1281), 8 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 355.0) internal successors, (3195), 9 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,549 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 355.0) internal successors, (3195), 9 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,550 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 326 flow. Second operand 8 states and 1281 transitions. [2022-12-13 12:37:35,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 966 flow [2022-12-13 12:37:35,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 961 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:37:35,770 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 404 flow [2022-12-13 12:37:35,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:37:35,770 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2022-12-13 12:37:35,770 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 404 flow [2022-12-13 12:37:35,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.8) internal successors, (1508), 10 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:35,770 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:35,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:37:35,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:35,972 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -223922237, now seen corresponding path program 1 times [2022-12-13 12:37:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:35,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075904638] [2022-12-13 12:37:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:35,975 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 [2022-12-13 12:37:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:35,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:35,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:36,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:37:36,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:36,167 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:36,167 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 [2022-12-13 12:37:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:36,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:37,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075904638] [2022-12-13 12:37:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075904638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:37,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:37,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-12-13 12:37:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590231703] [2022-12-13 12:37:37,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:37,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:37:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:37:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:37:41,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 355 [2022-12-13 12:37:41,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 404 flow. Second operand has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:41,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:41,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 355 [2022-12-13 12:37:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:50,435 INFO L130 PetriNetUnfolder]: 29141/40430 cut-off events. [2022-12-13 12:37:50,435 INFO L131 PetriNetUnfolder]: For 129962/134311 co-relation queries the response was YES. [2022-12-13 12:37:50,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156520 conditions, 40430 events. 29141/40430 cut-off events. For 129962/134311 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 244631 event pairs, 13879 based on Foata normal form. 5097/45288 useless extension candidates. Maximal degree in co-relation 156477. Up to 20281 conditions per place. [2022-12-13 12:37:50,692 INFO L137 encePairwiseOnDemand]: 347/355 looper letters, 196 selfloop transitions, 18 changer transitions 0/217 dead transitions. [2022-12-13 12:37:50,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 217 transitions, 1761 flow [2022-12-13 12:37:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:37:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 12:37:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2167 transitions. [2022-12-13 12:37:50,698 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4360160965794769 [2022-12-13 12:37:50,698 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2167 transitions. [2022-12-13 12:37:50,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2167 transitions. [2022-12-13 12:37:50,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:50,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2167 transitions. [2022-12-13 12:37:50,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.78571428571428) internal successors, (2167), 14 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:50,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 355.0) internal successors, (5325), 15 states have internal predecessors, (5325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:50,705 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 355.0) internal successors, (5325), 15 states have internal predecessors, (5325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:50,705 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 404 flow. Second operand 14 states and 2167 transitions. [2022-12-13 12:37:50,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 217 transitions, 1761 flow [2022-12-13 12:37:50,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 217 transitions, 1698 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:50,935 INFO L231 Difference]: Finished difference. Result has 106 places, 62 transitions, 478 flow [2022-12-13 12:37:50,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:37:50,936 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2022-12-13 12:37:50,936 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 62 transitions, 478 flow [2022-12-13 12:37:50,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:50,936 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:50,936 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:50,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:51,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:51,138 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:37:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1073284247, now seen corresponding path program 2 times [2022-12-13 12:37:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251959411] [2022-12-13 12:37:51,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:37:51,140 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 [2022-12-13 12:37:51,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:51,143 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:51,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:51,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:37:51,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:37:51,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:37:51,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:51,331 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:37:51,331 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 [2022-12-13 12:37:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:51,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:52,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251959411] [2022-12-13 12:37:52,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251959411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:52,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:52,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-12-13 12:37:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383859991] [2022-12-13 12:37:52,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:52,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:37:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:37:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:38:02,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 355 [2022-12-13 12:38:02,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 62 transitions, 478 flow. Second operand has 17 states, 17 states have (on average 148.1764705882353) internal successors, (2519), 17 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:02,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:02,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 355 [2022-12-13 12:38:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:13,362 INFO L130 PetriNetUnfolder]: 32217/44223 cut-off events. [2022-12-13 12:38:13,362 INFO L131 PetriNetUnfolder]: For 151172/158369 co-relation queries the response was YES. [2022-12-13 12:38:13,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185502 conditions, 44223 events. 32217/44223 cut-off events. For 151172/158369 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 283462 event pairs, 14435 based on Foata normal form. 6021/49400 useless extension candidates. Maximal degree in co-relation 185455. Up to 27922 conditions per place. [2022-12-13 12:38:13,799 INFO L137 encePairwiseOnDemand]: 346/355 looper letters, 302 selfloop transitions, 26 changer transitions 0/333 dead transitions. [2022-12-13 12:38:13,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 333 transitions, 2616 flow [2022-12-13 12:38:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:38:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 12:38:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2885 transitions. [2022-12-13 12:38:13,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4514866979655712 [2022-12-13 12:38:13,806 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2885 transitions. [2022-12-13 12:38:13,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2885 transitions. [2022-12-13 12:38:13,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:13,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2885 transitions. [2022-12-13 12:38:13,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 160.27777777777777) internal successors, (2885), 18 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:13,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:13,815 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:13,816 INFO L175 Difference]: Start difference. First operand has 106 places, 62 transitions, 478 flow. Second operand 18 states and 2885 transitions. [2022-12-13 12:38:13,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 333 transitions, 2616 flow [2022-12-13 12:38:14,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 333 transitions, 2556 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-13 12:38:14,356 INFO L231 Difference]: Finished difference. Result has 118 places, 77 transitions, 634 flow [2022-12-13 12:38:14,356 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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} [2022-12-13 12:38:14,357 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2022-12-13 12:38:14,357 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 77 transitions, 634 flow [2022-12-13 12:38:14,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 148.1764705882353) internal successors, (2519), 17 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:14,357 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:14,357 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1] [2022-12-13 12:38:14,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:14,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:14,558 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:38:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1509924994, now seen corresponding path program 3 times [2022-12-13 12:38:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:14,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387470049] [2022-12-13 12:38:14,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:38:14,560 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 [2022-12-13 12:38:14,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:14,561 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:38:14,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:14,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 12:38:14,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:38:14,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 12:38:14,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:14,916 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:38:14,916 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 [2022-12-13 12:38:14,976 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 13 treesize of output 9 [2022-12-13 12:38:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:38:15,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:38:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:38:15,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387470049] [2022-12-13 12:38:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387470049] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:38:15,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:38:15,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 12:38:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619244589] [2022-12-13 12:38:15,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:38:15,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 12:38:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 12:38:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:38:17,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 355 [2022-12-13 12:38:17,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 77 transitions, 634 flow. Second operand has 16 states, 16 states have (on average 149.25) internal successors, (2388), 16 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:17,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:17,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 355 [2022-12-13 12:38:17,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:24,309 INFO L130 PetriNetUnfolder]: 29213/39866 cut-off events. [2022-12-13 12:38:24,309 INFO L131 PetriNetUnfolder]: For 191908/198115 co-relation queries the response was YES. [2022-12-13 12:38:24,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182746 conditions, 39866 events. 29213/39866 cut-off events. For 191908/198115 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 252292 event pairs, 8795 based on Foata normal form. 4946/44350 useless extension candidates. Maximal degree in co-relation 182698. Up to 17605 conditions per place. [2022-12-13 12:38:24,640 INFO L137 encePairwiseOnDemand]: 348/355 looper letters, 266 selfloop transitions, 21 changer transitions 0/292 dead transitions. [2022-12-13 12:38:24,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 292 transitions, 2614 flow [2022-12-13 12:38:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:38:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 12:38:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2846 transitions. [2022-12-13 12:38:24,644 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4453834115805947 [2022-12-13 12:38:24,644 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2846 transitions. [2022-12-13 12:38:24,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2846 transitions. [2022-12-13 12:38:24,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:24,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2846 transitions. [2022-12-13 12:38:24,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 158.11111111111111) internal successors, (2846), 18 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:24,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:24,653 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:24,653 INFO L175 Difference]: Start difference. First operand has 118 places, 77 transitions, 634 flow. Second operand 18 states and 2846 transitions. [2022-12-13 12:38:24,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 292 transitions, 2614 flow [2022-12-13 12:38:25,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 292 transitions, 2543 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-13 12:38:25,231 INFO L231 Difference]: Finished difference. Result has 134 places, 84 transitions, 703 flow [2022-12-13 12:38:25,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=703, PETRI_PLACES=134, PETRI_TRANSITIONS=84} [2022-12-13 12:38:25,231 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 83 predicate places. [2022-12-13 12:38:25,231 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 84 transitions, 703 flow [2022-12-13 12:38:25,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 149.25) internal successors, (2388), 16 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:25,232 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2022-12-13 12:38:25,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:38:25,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:25,433 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:38:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 35694038, now seen corresponding path program 3 times [2022-12-13 12:38:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:25,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169698032] [2022-12-13 12:38:25,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:38:25,435 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 [2022-12-13 12:38:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:25,438 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:38:25,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:25,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 12:38:25,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:38:25,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:38:25,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:25,743 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:38:25,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 [2022-12-13 12:38:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:26,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:38:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:28,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169698032] [2022-12-13 12:38:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169698032] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:38:28,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:38:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-12-13 12:38:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948645190] [2022-12-13 12:38:28,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:38:28,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 12:38:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 12:38:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-12-13 12:38:44,263 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 355 [2022-12-13 12:38:44,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 84 transitions, 703 flow. Second operand has 24 states, 24 states have (on average 156.0) internal successors, (3744), 24 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:44,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:44,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 355 [2022-12-13 12:38:44,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:39:13,335 INFO L130 PetriNetUnfolder]: 69688/94920 cut-off events. [2022-12-13 12:39:13,335 INFO L131 PetriNetUnfolder]: For 448155/462904 co-relation queries the response was YES. [2022-12-13 12:39:13,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443377 conditions, 94920 events. 69688/94920 cut-off events. For 448155/462904 co-relation queries the response was YES. Maximal size of possible extension queue 2162. Compared 609467 event pairs, 42756 based on Foata normal form. 10189/104402 useless extension candidates. Maximal degree in co-relation 443324. Up to 24680 conditions per place. [2022-12-13 12:39:14,413 INFO L137 encePairwiseOnDemand]: 351/355 looper letters, 731 selfloop transitions, 24 changer transitions 0/765 dead transitions. [2022-12-13 12:39:14,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 765 transitions, 6727 flow [2022-12-13 12:39:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:39:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 12:39:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4233 transitions. [2022-12-13 12:39:14,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49683098591549296 [2022-12-13 12:39:14,419 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4233 transitions. [2022-12-13 12:39:14,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4233 transitions. [2022-12-13 12:39:14,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:39:14,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4233 transitions. [2022-12-13 12:39:14,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 176.375) internal successors, (4233), 24 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 355.0) internal successors, (8875), 25 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:14,429 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 355.0) internal successors, (8875), 25 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:14,429 INFO L175 Difference]: Start difference. First operand has 134 places, 84 transitions, 703 flow. Second operand 24 states and 4233 transitions. [2022-12-13 12:39:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 765 transitions, 6727 flow [2022-12-13 12:39:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 765 transitions, 6690 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 12:39:18,626 INFO L231 Difference]: Finished difference. Result has 165 places, 97 transitions, 857 flow [2022-12-13 12:39:18,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=857, PETRI_PLACES=165, PETRI_TRANSITIONS=97} [2022-12-13 12:39:18,627 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 114 predicate places. [2022-12-13 12:39:18,627 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 97 transitions, 857 flow [2022-12-13 12:39:18,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 156.0) internal successors, (3744), 24 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:18,627 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:39:18,627 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:39:18,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:39:18,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:39:18,828 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:39:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:39:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1090571532, now seen corresponding path program 2 times [2022-12-13 12:39:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:39:18,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919573473] [2022-12-13 12:39:18,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:39:18,829 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 [2022-12-13 12:39:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:39:18,830 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:39:18,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:39:18,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:39:18,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:39:18,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:39:18,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:39:19,034 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:39:19,035 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 [2022-12-13 12:39:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:39:19,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:39:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:39:20,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:39:20,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919573473] [2022-12-13 12:39:20,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919573473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:39:20,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:39:20,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-12-13 12:39:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494406366] [2022-12-13 12:39:20,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:39:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:39:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:39:20,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:39:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:39:28,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 355 [2022-12-13 12:39:28,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 97 transitions, 857 flow. Second operand has 17 states, 17 states have (on average 148.41176470588235) internal successors, (2523), 17 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:28,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:39:28,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 355 [2022-12-13 12:39:28,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:39:49,937 INFO L130 PetriNetUnfolder]: 77482/105978 cut-off events. [2022-12-13 12:39:49,937 INFO L131 PetriNetUnfolder]: For 465195/475238 co-relation queries the response was YES. [2022-12-13 12:39:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490204 conditions, 105978 events. 77482/105978 cut-off events. For 465195/475238 co-relation queries the response was YES. Maximal size of possible extension queue 2438. Compared 696943 event pairs, 43375 based on Foata normal form. 5086/107875 useless extension candidates. Maximal degree in co-relation 490137. Up to 90436 conditions per place. [2022-12-13 12:39:51,419 INFO L137 encePairwiseOnDemand]: 346/355 looper letters, 313 selfloop transitions, 26 changer transitions 0/348 dead transitions. [2022-12-13 12:39:51,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 348 transitions, 3029 flow [2022-12-13 12:39:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:39:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 12:39:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2869 transitions. [2022-12-13 12:39:51,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44898278560250393 [2022-12-13 12:39:51,425 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2869 transitions. [2022-12-13 12:39:51,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2869 transitions. [2022-12-13 12:39:51,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:39:51,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2869 transitions. [2022-12-13 12:39:51,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 159.38888888888889) internal successors, (2869), 18 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:51,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:51,433 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 355.0) internal successors, (6745), 19 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:51,433 INFO L175 Difference]: Start difference. First operand has 165 places, 97 transitions, 857 flow. Second operand 18 states and 2869 transitions. [2022-12-13 12:39:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 348 transitions, 3029 flow [2022-12-13 12:39:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 348 transitions, 2981 flow, removed 13 selfloop flow, removed 10 redundant places. [2022-12-13 12:39:57,176 INFO L231 Difference]: Finished difference. Result has 178 places, 108 transitions, 1015 flow [2022-12-13 12:39:57,176 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1015, PETRI_PLACES=178, PETRI_TRANSITIONS=108} [2022-12-13 12:39:57,176 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 127 predicate places. [2022-12-13 12:39:57,176 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 108 transitions, 1015 flow [2022-12-13 12:39:57,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 148.41176470588235) internal successors, (2523), 17 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:39:57,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:39:57,177 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:39:57,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:39:57,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:39:57,378 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:39:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:39:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash -949506471, now seen corresponding path program 1 times [2022-12-13 12:39:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:39:57,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051130643] [2022-12-13 12:39:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:39:57,380 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 [2022-12-13 12:39:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:39:57,383 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:39:57,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:39:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:39:57,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 12:39:57,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:39:57,577 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:39:57,578 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 [2022-12-13 12:39:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:39:57,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:39:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:39:59,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:39:59,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051130643] [2022-12-13 12:39:59,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051130643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:39:59,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:39:59,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-12-13 12:39:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499601738] [2022-12-13 12:39:59,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:39:59,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:39:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:39:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:39:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:40:09,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 355 [2022-12-13 12:40:09,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 108 transitions, 1015 flow. Second operand has 14 states, 14 states have (on average 145.71428571428572) internal successors, (2040), 14 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:09,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:40:09,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 355 [2022-12-13 12:40:09,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:40:37,924 INFO L130 PetriNetUnfolder]: 73828/102868 cut-off events. [2022-12-13 12:40:37,924 INFO L131 PetriNetUnfolder]: For 645792/659025 co-relation queries the response was YES. [2022-12-13 12:40:38,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496421 conditions, 102868 events. 73828/102868 cut-off events. For 645792/659025 co-relation queries the response was YES. Maximal size of possible extension queue 2140. Compared 673522 event pairs, 34369 based on Foata normal form. 11483/113789 useless extension candidates. Maximal degree in co-relation 496347. Up to 54100 conditions per place. [2022-12-13 12:40:39,309 INFO L137 encePairwiseOnDemand]: 347/355 looper letters, 382 selfloop transitions, 43 changer transitions 0/434 dead transitions. [2022-12-13 12:40:39,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 434 transitions, 4440 flow [2022-12-13 12:40:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 12:40:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 12:40:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3545 transitions. [2022-12-13 12:40:39,316 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4341702388242498 [2022-12-13 12:40:39,316 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3545 transitions. [2022-12-13 12:40:39,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3545 transitions. [2022-12-13 12:40:39,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:40:39,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3545 transitions. [2022-12-13 12:40:39,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 154.1304347826087) internal successors, (3545), 23 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:39,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 355.0) internal successors, (8520), 24 states have internal predecessors, (8520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:39,325 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 355.0) internal successors, (8520), 24 states have internal predecessors, (8520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:39,325 INFO L175 Difference]: Start difference. First operand has 178 places, 108 transitions, 1015 flow. Second operand 23 states and 3545 transitions. [2022-12-13 12:40:39,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 434 transitions, 4440 flow [2022-12-13 12:40:43,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 434 transitions, 4387 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 12:40:43,316 INFO L231 Difference]: Finished difference. Result has 202 places, 133 transitions, 1337 flow [2022-12-13 12:40:43,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1337, PETRI_PLACES=202, PETRI_TRANSITIONS=133} [2022-12-13 12:40:43,316 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 151 predicate places. [2022-12-13 12:40:43,316 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 133 transitions, 1337 flow [2022-12-13 12:40:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 145.71428571428572) internal successors, (2040), 14 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:43,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:40:43,317 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:40:43,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:40:43,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:40:43,518 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:40:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:40:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1628926248, now seen corresponding path program 2 times [2022-12-13 12:40:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:40:43,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35125738] [2022-12-13 12:40:43,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:40:43,521 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 [2022-12-13 12:40:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:40:43,524 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:40:43,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:40:43,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 12:40:43,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:40:43,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 12:40:43,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:40:43,716 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:40:43,716 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 [2022-12-13 12:40:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 12:40:43,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:40:43,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:40:43,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35125738] [2022-12-13 12:40:43,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35125738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:40:43,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:40:43,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:40:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562174224] [2022-12-13 12:40:43,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:40:43,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:40:43,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:40:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:40:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:40:44,450 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 355 [2022-12-13 12:40:44,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 133 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:44,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:40:44,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 355 [2022-12-13 12:40:44,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:40:56,626 INFO L130 PetriNetUnfolder]: 59659/83064 cut-off events. [2022-12-13 12:40:56,626 INFO L131 PetriNetUnfolder]: For 668088/678856 co-relation queries the response was YES. [2022-12-13 12:40:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445359 conditions, 83064 events. 59659/83064 cut-off events. For 668088/678856 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 534380 event pairs, 13106 based on Foata normal form. 13902/95967 useless extension candidates. Maximal degree in co-relation 445278. Up to 55867 conditions per place. [2022-12-13 12:40:57,686 INFO L137 encePairwiseOnDemand]: 351/355 looper letters, 152 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2022-12-13 12:40:57,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 177 transitions, 2098 flow [2022-12-13 12:40:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:40:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:40:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2022-12-13 12:40:57,689 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4490140845070423 [2022-12-13 12:40:57,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 797 transitions. [2022-12-13 12:40:57,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 797 transitions. [2022-12-13 12:40:57,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:40:57,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 797 transitions. [2022-12-13 12:40:57,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:57,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:57,691 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 355.0) internal successors, (2130), 6 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:40:57,691 INFO L175 Difference]: Start difference. First operand has 202 places, 133 transitions, 1337 flow. Second operand 5 states and 797 transitions. [2022-12-13 12:40:57,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 177 transitions, 2098 flow [2022-12-13 12:41:03,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 177 transitions, 1997 flow, removed 34 selfloop flow, removed 12 redundant places. [2022-12-13 12:41:03,693 INFO L231 Difference]: Finished difference. Result has 193 places, 132 transitions, 1256 flow [2022-12-13 12:41:03,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1256, PETRI_PLACES=193, PETRI_TRANSITIONS=132} [2022-12-13 12:41:03,694 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 142 predicate places. [2022-12-13 12:41:03,694 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 132 transitions, 1256 flow [2022-12-13 12:41:03,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:03,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:41:03,694 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2022-12-13 12:41:03,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:41:03,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:41:03,895 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:41:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 779564238, now seen corresponding path program 4 times [2022-12-13 12:41:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:41:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153930517] [2022-12-13 12:41:03,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:41:03,898 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 [2022-12-13 12:41:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:41:03,901 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:41:03,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:41:04,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:41:04,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:41:04,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:41:04,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:41:04,134 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:41:04,134 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 [2022-12-13 12:41:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 12:41:04,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:41:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 12:41:05,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:41:05,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153930517] [2022-12-13 12:41:05,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153930517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:41:05,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:41:05,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2022-12-13 12:41:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579509630] [2022-12-13 12:41:05,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:41:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 12:41:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:41:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 12:41:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:41:14,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 355 [2022-12-13 12:41:14,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 132 transitions, 1256 flow. Second operand has 16 states, 16 states have (on average 152.25) internal successors, (2436), 16 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:14,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:41:14,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 355 [2022-12-13 12:41:14,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:41:52,499 INFO L130 PetriNetUnfolder]: 135267/187342 cut-off events. [2022-12-13 12:41:52,499 INFO L131 PetriNetUnfolder]: For 2104080/2141033 co-relation queries the response was YES. [2022-12-13 12:41:54,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043316 conditions, 187342 events. 135267/187342 cut-off events. For 2104080/2141033 co-relation queries the response was YES. Maximal size of possible extension queue 4288. Compared 1370200 event pairs, 7705 based on Foata normal form. 29283/216378 useless extension candidates. Maximal degree in co-relation 1043240. Up to 54793 conditions per place. [2022-12-13 12:41:54,915 INFO L137 encePairwiseOnDemand]: 349/355 looper letters, 482 selfloop transitions, 37 changer transitions 0/529 dead transitions. [2022-12-13 12:41:54,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 529 transitions, 5720 flow [2022-12-13 12:41:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:41:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 12:41:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2319 transitions. [2022-12-13 12:41:54,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46659959758551306 [2022-12-13 12:41:54,920 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2319 transitions. [2022-12-13 12:41:54,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2319 transitions. [2022-12-13 12:41:54,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:41:54,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2319 transitions. [2022-12-13 12:41:54,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 165.64285714285714) internal successors, (2319), 14 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 355.0) internal successors, (5325), 15 states have internal predecessors, (5325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,926 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 355.0) internal successors, (5325), 15 states have internal predecessors, (5325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,926 INFO L175 Difference]: Start difference. First operand has 193 places, 132 transitions, 1256 flow. Second operand 14 states and 2319 transitions. [2022-12-13 12:41:54,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 529 transitions, 5720 flow [2022-12-13 12:42:10,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 529 transitions, 5694 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:42:10,703 INFO L231 Difference]: Finished difference. Result has 210 places, 139 transitions, 1408 flow [2022-12-13 12:42:10,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1408, PETRI_PLACES=210, PETRI_TRANSITIONS=139} [2022-12-13 12:42:10,704 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2022-12-13 12:42:10,704 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 139 transitions, 1408 flow [2022-12-13 12:42:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 152.25) internal successors, (2436), 16 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:10,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:10,705 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:42:10,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:42:10,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:42:10,906 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:42:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash -612181565, now seen corresponding path program 3 times [2022-12-13 12:42:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132493578] [2022-12-13 12:42:10,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:42:10,908 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 [2022-12-13 12:42:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:10,911 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:42:10,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:42:11,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 12:42:11,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:42:11,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 12:42:11,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:11,225 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:42:11,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 [2022-12-13 12:42:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:42:11,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:42:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:42:11,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:11,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132493578] [2022-12-13 12:42:11,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132493578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:42:11,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:42:11,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 12:42:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833128588] [2022-12-13 12:42:11,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:42:11,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 12:42:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:11,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 12:42:11,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:42:17,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 355 [2022-12-13 12:42:17,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 139 transitions, 1408 flow. Second operand has 16 states, 16 states have (on average 149.5) internal successors, (2392), 16 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:17,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:17,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 355 [2022-12-13 12:42:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:52,948 INFO L130 PetriNetUnfolder]: 146159/202461 cut-off events. [2022-12-13 12:42:52,949 INFO L131 PetriNetUnfolder]: For 1969673/1990789 co-relation queries the response was YES. [2022-12-13 12:42:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177399 conditions, 202461 events. 146159/202461 cut-off events. For 1969673/1990789 co-relation queries the response was YES. Maximal size of possible extension queue 4367. Compared 1459630 event pairs, 96384 based on Foata normal form. 8074/209725 useless extension candidates. Maximal degree in co-relation 1177316. Up to 198294 conditions per place. [2022-12-13 12:42:55,725 INFO L137 encePairwiseOnDemand]: 349/355 looper letters, 248 selfloop transitions, 17 changer transitions 0/276 dead transitions. [2022-12-13 12:42:55,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 276 transitions, 2703 flow [2022-12-13 12:42:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:42:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 12:42:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2374 transitions. [2022-12-13 12:42:55,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4458215962441315 [2022-12-13 12:42:55,731 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2374 transitions. [2022-12-13 12:42:55,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2374 transitions. [2022-12-13 12:42:55,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:55,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2374 transitions. [2022-12-13 12:42:55,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 158.26666666666668) internal successors, (2374), 15 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:55,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 355.0) internal successors, (5680), 16 states have internal predecessors, (5680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:55,741 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 355.0) internal successors, (5680), 16 states have internal predecessors, (5680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:55,741 INFO L175 Difference]: Start difference. First operand has 210 places, 139 transitions, 1408 flow. Second operand 15 states and 2374 transitions. [2022-12-13 12:42:55,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 276 transitions, 2703 flow [2022-12-13 12:43:09,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 276 transitions, 2614 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 12:43:09,418 INFO L231 Difference]: Finished difference. Result has 222 places, 142 transitions, 1427 flow [2022-12-13 12:43:09,418 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1427, PETRI_PLACES=222, PETRI_TRANSITIONS=142} [2022-12-13 12:43:09,418 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 171 predicate places. [2022-12-13 12:43:09,418 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 142 transitions, 1427 flow [2022-12-13 12:43:09,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 149.5) internal successors, (2392), 16 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:09,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:43:09,419 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:09,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:43:09,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:43:09,620 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:43:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1952134472, now seen corresponding path program 4 times [2022-12-13 12:43:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:43:09,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566127982] [2022-12-13 12:43:09,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:43:09,622 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 [2022-12-13 12:43:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:43:09,625 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:43:09,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:43:09,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:43:09,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:43:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 12:43:09,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:43:09,846 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:43:09,846 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 [2022-12-13 12:43:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:43:10,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:43:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:12,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:43:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566127982] [2022-12-13 12:43:12,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566127982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:43:12,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:43:12,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2022-12-13 12:43:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530196067] [2022-12-13 12:43:12,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:43:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 12:43:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:43:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 12:43:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-12-13 12:43:28,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 355 [2022-12-13 12:43:28,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 142 transitions, 1427 flow. Second operand has 22 states, 22 states have (on average 147.36363636363637) internal successors, (3242), 22 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:28,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:43:28,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 355 [2022-12-13 12:43:28,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:44:06,393 INFO L130 PetriNetUnfolder]: 142704/198026 cut-off events. [2022-12-13 12:44:06,393 INFO L131 PetriNetUnfolder]: For 1802393/1824180 co-relation queries the response was YES. [2022-12-13 12:44:08,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115024 conditions, 198026 events. 142704/198026 cut-off events. For 1802393/1824180 co-relation queries the response was YES. Maximal size of possible extension queue 4183. Compared 1416442 event pairs, 87441 based on Foata normal form. 7930/204398 useless extension candidates. Maximal degree in co-relation 1114937. Up to 180084 conditions per place. [2022-12-13 12:44:09,387 INFO L137 encePairwiseOnDemand]: 347/355 looper letters, 427 selfloop transitions, 51 changer transitions 0/489 dead transitions. [2022-12-13 12:44:09,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 489 transitions, 4687 flow [2022-12-13 12:44:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:44:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 12:44:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3783 transitions. [2022-12-13 12:44:09,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4440140845070423 [2022-12-13 12:44:09,393 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3783 transitions. [2022-12-13 12:44:09,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3783 transitions. [2022-12-13 12:44:09,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:44:09,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3783 transitions. [2022-12-13 12:44:09,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 157.625) internal successors, (3783), 24 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:09,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 355.0) internal successors, (8875), 25 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:09,402 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 355.0) internal successors, (8875), 25 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:09,403 INFO L175 Difference]: Start difference. First operand has 222 places, 142 transitions, 1427 flow. Second operand 24 states and 3783 transitions. [2022-12-13 12:44:09,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 489 transitions, 4687 flow [2022-12-13 12:44:24,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 489 transitions, 4662 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-12-13 12:44:24,044 INFO L231 Difference]: Finished difference. Result has 238 places, 160 transitions, 1772 flow [2022-12-13 12:44:24,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1772, PETRI_PLACES=238, PETRI_TRANSITIONS=160} [2022-12-13 12:44:24,045 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 187 predicate places. [2022-12-13 12:44:24,045 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 160 transitions, 1772 flow [2022-12-13 12:44:24,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 147.36363636363637) internal successors, (3242), 22 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:24,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:44:24,045 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:44:24,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:44:24,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:44:24,247 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:44:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:44:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1380362009, now seen corresponding path program 5 times [2022-12-13 12:44:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:44:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706895838] [2022-12-13 12:44:24,249 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:44:24,249 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 [2022-12-13 12:44:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:44:24,252 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:44:24,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:44:24,407 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 12:44:24,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:44:24,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 12:44:24,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:44:24,514 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:44:24,514 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 [2022-12-13 12:44:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 12:44:24,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:44:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 12:44:26,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:44:26,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706895838] [2022-12-13 12:44:26,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706895838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:44:26,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:44:26,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-12-13 12:44:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419829470] [2022-12-13 12:44:26,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:44:26,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 12:44:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:44:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 12:44:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-12-13 12:44:38,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 355 [2022-12-13 12:44:38,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 160 transitions, 1772 flow. Second operand has 18 states, 18 states have (on average 144.44444444444446) internal successors, (2600), 18 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:38,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:44:38,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 355 [2022-12-13 12:44:38,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:01,768 INFO L130 PetriNetUnfolder]: 293248/411693 cut-off events. [2022-12-13 12:46:01,768 INFO L131 PetriNetUnfolder]: For 4776615/4817567 co-relation queries the response was YES. [2022-12-13 12:46:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423629 conditions, 411693 events. 293248/411693 cut-off events. For 4776615/4817567 co-relation queries the response was YES. Maximal size of possible extension queue 8864. Compared 3333342 event pairs, 16219 based on Foata normal form. 38578/449637 useless extension candidates. Maximal degree in co-relation 2423541. Up to 119881 conditions per place. [2022-12-13 12:46:08,622 INFO L137 encePairwiseOnDemand]: 348/355 looper letters, 566 selfloop transitions, 41 changer transitions 0/618 dead transitions. [2022-12-13 12:46:08,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 618 transitions, 6842 flow [2022-12-13 12:46:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 12:46:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 12:46:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2942 transitions. [2022-12-13 12:46:08,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43617494440326166 [2022-12-13 12:46:08,629 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2942 transitions. [2022-12-13 12:46:08,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2942 transitions. [2022-12-13 12:46:08,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:08,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2942 transitions. [2022-12-13 12:46:08,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 154.8421052631579) internal successors, (2942), 19 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:08,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 355.0) internal successors, (7100), 20 states have internal predecessors, (7100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:08,638 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 355.0) internal successors, (7100), 20 states have internal predecessors, (7100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:08,762 INFO L175 Difference]: Start difference. First operand has 238 places, 160 transitions, 1772 flow. Second operand 19 states and 2942 transitions. [2022-12-13 12:46:08,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 618 transitions, 6842 flow [2022-12-13 12:47:14,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 618 transitions, 6706 flow, removed 30 selfloop flow, removed 20 redundant places. [2022-12-13 12:47:14,136 INFO L231 Difference]: Finished difference. Result has 239 places, 169 transitions, 1836 flow [2022-12-13 12:47:14,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1836, PETRI_PLACES=239, PETRI_TRANSITIONS=169} [2022-12-13 12:47:14,136 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 188 predicate places. [2022-12-13 12:47:14,136 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 169 transitions, 1836 flow [2022-12-13 12:47:14,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 144.44444444444446) internal successors, (2600), 18 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:47:14,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:14,137 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 3, 1, 1, 1, 1, 1] [2022-12-13 12:47:14,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:47:14,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:47:14,338 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 12:47:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -430710327, now seen corresponding path program 5 times [2022-12-13 12:47:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:47:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142263800] [2022-12-13 12:47:14,341 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:47:14,342 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 [2022-12-13 12:47:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:47:14,345 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:47:14,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e3d51b3-1cf5-4fce-9351-3e61851151b8/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:47:14,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 12:47:14,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:47:14,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 12:47:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:47:14,662 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-12-13 12:47:14,663 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 [2022-12-13 12:47:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:47:15,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:47:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:18,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:47:18,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142263800] [2022-12-13 12:47:18,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142263800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:47:18,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:47:18,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2022-12-13 12:47:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743215311] [2022-12-13 12:47:18,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:47:18,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 12:47:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:47:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 12:47:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-12-13 12:47:48,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 355 [2022-12-13 12:47:48,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 169 transitions, 1836 flow. Second operand has 31 states, 31 states have (on average 150.1290322580645) internal successors, (4654), 31 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:47:48,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:48,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 355 [2022-12-13 12:47:48,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand