./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:00,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:00,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:00,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:00,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:00,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:00,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:00,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:00,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:00,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:00,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:00,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:00,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:00,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:00,375 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:00,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:00,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:00,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:00,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:00,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:00,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:00,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:00,378 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-01-10 01:00:00,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:00,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:00,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:00,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:00,688 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:00,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-10 01:00:02,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ee4f093/a51324ae1a244d8b868aa55e787d5d06/FLAGc8ace0c32 [2025-01-10 01:00:02,473 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:02,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-10 01:00:02,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ee4f093/a51324ae1a244d8b868aa55e787d5d06/FLAGc8ace0c32 [2025-01-10 01:00:02,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ee4f093/a51324ae1a244d8b868aa55e787d5d06 [2025-01-10 01:00:02,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:02,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:02,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:02,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:02,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:02,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:02" (1/1) ... [2025-01-10 01:00:02,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:02, skipping insertion in model container [2025-01-10 01:00:02,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:02" (1/1) ... [2025-01-10 01:00:02,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:02,908 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:02,909 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:02,909 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:02,909 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:02,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:02,978 ERROR L321 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) [2025-01-10 01:00:02,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70d358d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:02, skipping insertion in model container [2025-01-10 01:00:02,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:02,979 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-01-10 01:00:02,980 INFO L158 Benchmark]: Toolchain (without parser) took 459.17ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 93.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:00:02,981 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:00:02,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.80ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 93.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:00:02,982 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.80ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 93.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1051]: 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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:05,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:05,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 01:00:05,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:05,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:05,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:05,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:05,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:05,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:05,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:05,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:05,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:05,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:05,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:05,410 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:05,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:05,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:05,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:05,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:05,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:05,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:05,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:05,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:05,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:05,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:05,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-01-10 01:00:05,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:05,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:05,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:05,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:05,714 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:05,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-10 01:00:07,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a03ee61df/b4acfd404145410baf44c7b57383371a/FLAG7c8883fb9 [2025-01-10 01:00:07,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:07,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-10 01:00:07,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a03ee61df/b4acfd404145410baf44c7b57383371a/FLAG7c8883fb9 [2025-01-10 01:00:07,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a03ee61df/b4acfd404145410baf44c7b57383371a [2025-01-10 01:00:07,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:07,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:07,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:07,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:07,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:07,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:07" (1/1) ... [2025-01-10 01:00:07,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207c4489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:07, skipping insertion in model container [2025-01-10 01:00:07,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:07" (1/1) ... [2025-01-10 01:00:07,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:08,144 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,147 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,147 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,148 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:08,242 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-10 01:00:08,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:08,301 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,302 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,302 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,302 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:08,347 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:08,396 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,396 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,396 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,396 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 01:00:08,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:08,474 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:08,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08 WrapperNode [2025-01-10 01:00:08,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:08,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:08,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:08,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:08,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,550 INFO L138 Inliner]: procedures = 284, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 290 [2025-01-10 01:00:08,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:08,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:08,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:08,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:08,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,604 INFO L175 MemorySlicer]: Split 110 memory accesses to 4 slices as follows [2, 5, 2, 101]. 92 percent of accesses are in the largest equivalence class. The 87 initializations are split as follows [2, 5, 0, 80]. The 13 writes are split as follows [0, 0, 1, 12]. [2025-01-10 01:00:08,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:08,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:08,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:08,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:08,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (1/1) ... [2025-01-10 01:00:08,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:08,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:00:08,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 01:00:08,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:00:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 01:00:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 01:00:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 01:00:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:08,713 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:00:08,917 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:08,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:10,035 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:10,036 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:11,782 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:11,783 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 01:00:11,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:11 BoogieIcfgContainer [2025-01-10 01:00:11,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:11,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:11,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:11,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:11,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:07" (1/3) ... [2025-01-10 01:00:11,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bba23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:11, skipping insertion in model container [2025-01-10 01:00:11,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:08" (2/3) ... [2025-01-10 01:00:11,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bba23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:11, skipping insertion in model container [2025-01-10 01:00:11,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:11" (3/3) ... [2025-01-10 01:00:11,793 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-01-10 01:00:11,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:11,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 115 locations, 1 initial locations, 11 loop locations, and 48 error locations. [2025-01-10 01:00:11,809 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:11,886 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 01:00:11,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2025-01-10 01:00:11,982 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2025-01-10 01:00:11,984 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:00:11,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 145 events. 18/145 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 539 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2025-01-10 01:00:11,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2025-01-10 01:00:11,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2025-01-10 01:00:12,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:12,014 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49264ccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:12,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2025-01-10 01:00:12,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:12,029 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 01:00:12,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:00:12,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:12,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:12,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 806426, now seen corresponding path program 1 times [2025-01-10 01:00:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145736393] [2025-01-10 01:00:12,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:12,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:12,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:12,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:00:12,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:12,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:12,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:12,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:12,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:00:12,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:12,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:12,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145736393] [2025-01-10 01:00:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145736393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712499023] [2025-01-10 01:00:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:12,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:12,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 133 [2025-01-10 01:00:12,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 133 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:12,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:12,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 133 [2025-01-10 01:00:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:13,142 INFO L124 PetriNetUnfolderBase]: 120/487 cut-off events. [2025-01-10 01:00:13,143 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-10 01:00:13,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 487 events. 120/487 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2709 event pairs, 61 based on Foata normal form. 52/423 useless extension candidates. Maximal degree in co-relation 660. Up to 170 conditions per place. [2025-01-10 01:00:13,152 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 64 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-01-10 01:00:13,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 138 transitions, 419 flow [2025-01-10 01:00:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions. [2025-01-10 01:00:13,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7086466165413534 [2025-01-10 01:00:13,169 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 377 transitions. [2025-01-10 01:00:13,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 138 transitions, 419 flow [2025-01-10 01:00:13,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 419 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:13,182 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2025-01-10 01:00:13,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-01-10 01:00:13,190 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-01-10 01:00:13,191 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2025-01-10 01:00:13,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:13,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:13,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:00:13,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:13,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:13,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash 806427, now seen corresponding path program 1 times [2025-01-10 01:00:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158683503] [2025-01-10 01:00:13,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:13,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:13,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:00:13,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:00:13,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:00:13,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:13,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:13,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:00:13,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:13,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:13,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158683503] [2025-01-10 01:00:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158683503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832146440] [2025-01-10 01:00:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:13,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:13,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:13,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:14,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2025-01-10 01:00:14,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:14,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:14,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2025-01-10 01:00:14,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:14,517 INFO L124 PetriNetUnfolderBase]: 122/520 cut-off events. [2025-01-10 01:00:14,517 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-01-10 01:00:14,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 520 events. 122/520 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2848 event pairs, 100 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 728. Up to 263 conditions per place. [2025-01-10 01:00:14,521 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 46 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2025-01-10 01:00:14,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 369 flow [2025-01-10 01:00:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2025-01-10 01:00:14,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2025-01-10 01:00:14,525 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 346 transitions. [2025-01-10 01:00:14,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 369 flow [2025-01-10 01:00:14,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:14,529 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2025-01-10 01:00:14,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-01-10 01:00:14,530 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2025-01-10 01:00:14,530 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2025-01-10 01:00:14,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:14,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:14,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:00:14,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:14,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1744801206, now seen corresponding path program 1 times [2025-01-10 01:00:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833537759] [2025-01-10 01:00:14,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:14,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:14,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:00:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:15,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:15,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:15,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:15,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:15,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:15,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-01-10 01:00:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:15,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:15,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833537759] [2025-01-10 01:00:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833537759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:15,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035013462] [2025-01-10 01:00:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:15,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:15,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:15,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2025-01-10 01:00:15,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:15,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:15,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2025-01-10 01:00:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:15,483 INFO L124 PetriNetUnfolderBase]: 122/519 cut-off events. [2025-01-10 01:00:15,484 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-01-10 01:00:15,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 519 events. 122/519 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2841 event pairs, 100 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 798. Up to 259 conditions per place. [2025-01-10 01:00:15,488 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 44 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-01-10 01:00:15,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 378 flow [2025-01-10 01:00:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2025-01-10 01:00:15,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.681704260651629 [2025-01-10 01:00:15,491 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 272 transitions. [2025-01-10 01:00:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 378 flow [2025-01-10 01:00:15,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:15,498 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2025-01-10 01:00:15,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-01-10 01:00:15,498 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2025-01-10 01:00:15,498 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2025-01-10 01:00:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:15,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:15,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:00:15,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:00:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:15,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1744801205, now seen corresponding path program 1 times [2025-01-10 01:00:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855018761] [2025-01-10 01:00:15,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:15,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:15,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:15,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:00:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:00:16,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:00:16,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:16,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:16,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:00:16,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:16,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:16,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:16,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855018761] [2025-01-10 01:00:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855018761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:16,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223314720] [2025-01-10 01:00:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:16,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:16,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2025-01-10 01:00:16,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:16,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:16,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2025-01-10 01:00:16,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:16,483 INFO L124 PetriNetUnfolderBase]: 122/518 cut-off events. [2025-01-10 01:00:16,483 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-01-10 01:00:16,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 518 events. 122/518 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2832 event pairs, 100 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 797. Up to 259 conditions per place. [2025-01-10 01:00:16,487 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 44 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-01-10 01:00:16,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 379 flow [2025-01-10 01:00:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2025-01-10 01:00:16,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.681704260651629 [2025-01-10 01:00:16,489 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 272 transitions. [2025-01-10 01:00:16,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 379 flow [2025-01-10 01:00:16,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:16,493 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2025-01-10 01:00:16,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2025-01-10 01:00:16,497 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2025-01-10 01:00:16,497 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2025-01-10 01:00:16,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:16,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:16,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:16,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:16,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:16,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1745738302, now seen corresponding path program 1 times [2025-01-10 01:00:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324124748] [2025-01-10 01:00:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:16,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:16,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:00:16,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:16,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:00:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:16,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:16,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324124748] [2025-01-10 01:00:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324124748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442608114] [2025-01-10 01:00:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:16,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:16,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:16,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:17,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2025-01-10 01:00:17,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:17,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:17,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2025-01-10 01:00:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:17,265 INFO L124 PetriNetUnfolderBase]: 122/516 cut-off events. [2025-01-10 01:00:17,265 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-10 01:00:17,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 516 events. 122/516 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2822 event pairs, 100 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 797. Up to 261 conditions per place. [2025-01-10 01:00:17,268 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 44 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-01-10 01:00:17,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 379 flow [2025-01-10 01:00:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-01-10 01:00:17,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516290726817042 [2025-01-10 01:00:17,270 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 260 transitions. [2025-01-10 01:00:17,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 379 flow [2025-01-10 01:00:17,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:17,276 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 285 flow [2025-01-10 01:00:17,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2025-01-10 01:00:17,278 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-01-10 01:00:17,278 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 285 flow [2025-01-10 01:00:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:17,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:17,279 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:00:17,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:00:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:17,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1745737703, now seen corresponding path program 1 times [2025-01-10 01:00:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618380526] [2025-01-10 01:00:17,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:17,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:17,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:00:17,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:17,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:17,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:17,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:17,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:00:17,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:17,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:17,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618380526] [2025-01-10 01:00:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618380526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:17,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:17,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006643840] [2025-01-10 01:00:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:17,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:17,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:17,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:17,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2025-01-10 01:00:17,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:17,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:17,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2025-01-10 01:00:17,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:17,973 INFO L124 PetriNetUnfolderBase]: 121/536 cut-off events. [2025-01-10 01:00:17,973 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-01-10 01:00:17,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 536 events. 121/536 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2860 event pairs, 100 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 825. Up to 259 conditions per place. [2025-01-10 01:00:17,975 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 48 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2025-01-10 01:00:17,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 399 flow [2025-01-10 01:00:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-01-10 01:00:17,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2025-01-10 01:00:17,977 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 285 flow. Second operand 3 states and 280 transitions. [2025-01-10 01:00:17,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 399 flow [2025-01-10 01:00:18,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:18,003 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 286 flow [2025-01-10 01:00:18,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-01-10 01:00:18,003 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-01-10 01:00:18,003 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 286 flow [2025-01-10 01:00:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:18,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:18,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:18,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:00:18,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:18,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1745738303, now seen corresponding path program 1 times [2025-01-10 01:00:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208021579] [2025-01-10 01:00:18,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:18,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:18,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:00:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:00:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:00:18,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:18,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:18,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:18,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:18,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:18,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208021579] [2025-01-10 01:00:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208021579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512234241] [2025-01-10 01:00:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:18,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:18,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:18,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:18,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2025-01-10 01:00:18,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:18,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:18,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2025-01-10 01:00:18,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:18,967 INFO L124 PetriNetUnfolderBase]: 121/532 cut-off events. [2025-01-10 01:00:18,968 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2025-01-10 01:00:18,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 532 events. 121/532 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2827 event pairs, 100 based on Foata normal form. 2/411 useless extension candidates. Maximal degree in co-relation 820. Up to 263 conditions per place. [2025-01-10 01:00:18,970 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 45 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-01-10 01:00:18,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 380 flow [2025-01-10 01:00:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-01-10 01:00:18,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296992481203008 [2025-01-10 01:00:18,972 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 286 flow. Second operand 4 states and 335 transitions. [2025-01-10 01:00:18,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 380 flow [2025-01-10 01:00:18,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:18,975 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 287 flow [2025-01-10 01:00:18,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2025-01-10 01:00:18,975 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-01-10 01:00:18,976 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 287 flow [2025-01-10 01:00:18,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:18,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:18,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:18,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:00:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:19,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:19,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1677677716, now seen corresponding path program 1 times [2025-01-10 01:00:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733015791] [2025-01-10 01:00:19,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:19,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:19,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:00:19,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:00:19,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:00:19,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:19,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:19,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:00:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:19,516 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-01-10 01:00:19,516 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-10 01:00:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:19,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:19,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733015791] [2025-01-10 01:00:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733015791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:19,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:19,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762705588] [2025-01-10 01:00:19,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:19,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:19,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:19,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:20,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 133 [2025-01-10 01:00:20,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:20,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:20,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 133 [2025-01-10 01:00:20,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:20,414 INFO L124 PetriNetUnfolderBase]: 120/500 cut-off events. [2025-01-10 01:00:20,414 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-01-10 01:00:20,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 500 events. 120/500 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2646 event pairs, 61 based on Foata normal form. 2/389 useless extension candidates. Maximal degree in co-relation 800. Up to 177 conditions per place. [2025-01-10 01:00:20,417 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-01-10 01:00:20,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 134 transitions, 471 flow [2025-01-10 01:00:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 350 transitions. [2025-01-10 01:00:20,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2025-01-10 01:00:20,419 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 287 flow. Second operand 4 states and 350 transitions. [2025-01-10 01:00:20,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 134 transitions, 471 flow [2025-01-10 01:00:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 134 transitions, 463 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:20,422 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2025-01-10 01:00:20,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-01-10 01:00:20,423 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2025-01-10 01:00:20,423 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2025-01-10 01:00:20,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:20,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:20,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:20,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:00:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:20,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1677677715, now seen corresponding path program 1 times [2025-01-10 01:00:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246581170] [2025-01-10 01:00:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:20,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:20,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:20,627 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:20,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:00:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:00:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:00:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:20,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:00:20,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:21,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:00:21,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:00:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:21,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:21,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246581170] [2025-01-10 01:00:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246581170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:21,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068044968] [2025-01-10 01:00:21,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:21,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:21,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:21,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2025-01-10 01:00:21,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:21,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:21,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2025-01-10 01:00:21,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:21,822 INFO L124 PetriNetUnfolderBase]: 123/560 cut-off events. [2025-01-10 01:00:21,822 INFO L125 PetriNetUnfolderBase]: For 50/51 co-relation queries the response was YES. [2025-01-10 01:00:21,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 560 events. 123/560 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3086 event pairs, 101 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 843. Up to 270 conditions per place. [2025-01-10 01:00:21,825 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 52 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2025-01-10 01:00:21,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 429 flow [2025-01-10 01:00:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-01-10 01:00:21,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466165413533834 [2025-01-10 01:00:21,827 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 344 transitions. [2025-01-10 01:00:21,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 429 flow [2025-01-10 01:00:21,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:21,830 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2025-01-10 01:00:21,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-01-10 01:00:21,831 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-01-10 01:00:21,831 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2025-01-10 01:00:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:21,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:21,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:21,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:00:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:22,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -468400746, now seen corresponding path program 1 times [2025-01-10 01:00:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:22,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887201602] [2025-01-10 01:00:22,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:22,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:22,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:22,037 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:22,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:00:22,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:00:22,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:00:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:22,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:00:22,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:00:22,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:00:22,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 01:00:22,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 01:00:22,647 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 01:00:22,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-10 01:00:22,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:00:22,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:22,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:22,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887201602] [2025-01-10 01:00:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887201602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:00:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131858037] [2025-01-10 01:00:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:00:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:22,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:00:22,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:00:24,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 01:00:24,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 321 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:24,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:24,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 01:00:24,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,302 INFO L124 PetriNetUnfolderBase]: 123/559 cut-off events. [2025-01-10 01:00:25,303 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2025-01-10 01:00:25,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 559 events. 123/559 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3074 event pairs, 101 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 855. Up to 283 conditions per place. [2025-01-10 01:00:25,306 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 67 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2025-01-10 01:00:25,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 515 flow [2025-01-10 01:00:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:00:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:00:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 705 transitions. [2025-01-10 01:00:25,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4818865345181135 [2025-01-10 01:00:25,309 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 11 states and 705 transitions. [2025-01-10 01:00:25,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 515 flow [2025-01-10 01:00:25,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 132 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:25,312 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 377 flow [2025-01-10 01:00:25,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2025-01-10 01:00:25,314 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2025-01-10 01:00:25,314 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 377 flow [2025-01-10 01:00:25,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:25,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:25,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -468400747, now seen corresponding path program 1 times [2025-01-10 01:00:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832623819] [2025-01-10 01:00:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:25,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:25,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:00:25,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:00:25,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:00:25,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:00:25,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:25,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:00:25,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 01:00:25,955 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 01:00:25,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-10 01:00:25,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:26,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:26,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-10 01:00:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:26,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832623819] [2025-01-10 01:00:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832623819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:26,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:00:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930066556] [2025-01-10 01:00:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:00:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:26,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:00:26,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:00:27,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2025-01-10 01:00:27,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 377 flow. Second operand has 10 states, 10 states have (on average 60.0) internal successors, (600), 10 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:27,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:27,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2025-01-10 01:00:27,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:28,556 INFO L124 PetriNetUnfolderBase]: 123/558 cut-off events. [2025-01-10 01:00:28,556 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-01-10 01:00:28,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 558 events. 123/558 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3074 event pairs, 101 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 896. Up to 279 conditions per place. [2025-01-10 01:00:28,559 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 65 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2025-01-10 01:00:28,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 132 transitions, 559 flow [2025-01-10 01:00:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:00:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:00:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 725 transitions. [2025-01-10 01:00:28,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4955570745044429 [2025-01-10 01:00:28,562 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 377 flow. Second operand 11 states and 725 transitions. [2025-01-10 01:00:28,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 132 transitions, 559 flow [2025-01-10 01:00:28,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 132 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:28,565 INFO L231 Difference]: Finished difference. Result has 140 places, 121 transitions, 399 flow [2025-01-10 01:00:28,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=399, PETRI_PLACES=140, PETRI_TRANSITIONS=121} [2025-01-10 01:00:28,566 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2025-01-10 01:00:28,566 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 121 transitions, 399 flow [2025-01-10 01:00:28,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 60.0) internal successors, (600), 10 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:28,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:28,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:28,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:00:28,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:28,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1635520485, now seen corresponding path program 1 times [2025-01-10 01:00:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105525512] [2025-01-10 01:00:28,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:28,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:28,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:28,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:00:28,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:29,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:00:29,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:29,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:29,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:29,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105525512] [2025-01-10 01:00:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105525512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:29,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248126845] [2025-01-10 01:00:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:29,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:29,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 133 [2025-01-10 01:00:29,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 121 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:29,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 133 [2025-01-10 01:00:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:29,525 INFO L124 PetriNetUnfolderBase]: 122/548 cut-off events. [2025-01-10 01:00:29,525 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2025-01-10 01:00:29,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 548 events. 122/548 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3013 event pairs, 100 based on Foata normal form. 8/438 useless extension candidates. Maximal degree in co-relation 880. Up to 260 conditions per place. [2025-01-10 01:00:29,528 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 45 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-01-10 01:00:29,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 119 transitions, 503 flow [2025-01-10 01:00:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:00:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:00:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2025-01-10 01:00:29,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2025-01-10 01:00:29,530 INFO L175 Difference]: Start difference. First operand has 140 places, 121 transitions, 399 flow. Second operand 4 states and 341 transitions. [2025-01-10 01:00:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 119 transitions, 503 flow [2025-01-10 01:00:29,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 119 transitions, 481 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 01:00:29,533 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 391 flow [2025-01-10 01:00:29,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2025-01-10 01:00:29,536 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2025-01-10 01:00:29,537 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 391 flow [2025-01-10 01:00:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:29,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:29,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:00:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:29,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1635520486, now seen corresponding path program 1 times [2025-01-10 01:00:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780329943] [2025-01-10 01:00:29,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:29,741 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:29,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:00:29,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:00:29,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:00:29,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:29,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:00:30,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780329943] [2025-01-10 01:00:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780329943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:30,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363392593] [2025-01-10 01:00:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:30,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:30,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:30,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 133 [2025-01-10 01:00:30,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 133 [2025-01-10 01:00:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,468 INFO L124 PetriNetUnfolderBase]: 122/540 cut-off events. [2025-01-10 01:00:30,468 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-10 01:00:30,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 540 events. 122/540 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2974 event pairs, 100 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 892. Up to 262 conditions per place. [2025-01-10 01:00:30,471 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 48 selfloop transitions, 11 changer transitions 0/117 dead transitions. [2025-01-10 01:00:30,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 117 transitions, 505 flow [2025-01-10 01:00:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 399 transitions. [2025-01-10 01:00:30,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 01:00:30,472 INFO L175 Difference]: Start difference. First operand has 131 places, 119 transitions, 391 flow. Second operand 5 states and 399 transitions. [2025-01-10 01:00:30,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 117 transitions, 505 flow [2025-01-10 01:00:30,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 117 transitions, 487 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:30,475 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 391 flow [2025-01-10 01:00:30,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2025-01-10 01:00:30,476 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2025-01-10 01:00:30,476 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 391 flow [2025-01-10 01:00:30,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,476 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:30,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:30,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -517421797, now seen corresponding path program 1 times [2025-01-10 01:00:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014096395] [2025-01-10 01:00:30,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:30,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:30,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:30,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:00:30,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:00:30,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:00:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:30,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014096395] [2025-01-10 01:00:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014096395] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:31,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:00:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-10 01:00:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066786566] [2025-01-10 01:00:31,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:31,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:31,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:31,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:31,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2025-01-10 01:00:31,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 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) [2025-01-10 01:00:31,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:31,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2025-01-10 01:00:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,385 INFO L124 PetriNetUnfolderBase]: 122/590 cut-off events. [2025-01-10 01:00:31,385 INFO L125 PetriNetUnfolderBase]: For 154/155 co-relation queries the response was YES. [2025-01-10 01:00:31,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 590 events. 122/590 cut-off events. For 154/155 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3103 event pairs, 100 based on Foata normal form. 6/482 useless extension candidates. Maximal degree in co-relation 1013. Up to 256 conditions per place. [2025-01-10 01:00:31,389 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 62 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2025-01-10 01:00:31,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 665 flow [2025-01-10 01:00:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:00:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:00:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-01-10 01:00:31,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656641604010025 [2025-01-10 01:00:31,391 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 391 flow. Second operand 6 states and 524 transitions. [2025-01-10 01:00:31,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 136 transitions, 665 flow [2025-01-10 01:00:31,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 611 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:31,395 INFO L231 Difference]: Finished difference. Result has 135 places, 122 transitions, 455 flow [2025-01-10 01:00:31,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=135, PETRI_TRANSITIONS=122} [2025-01-10 01:00:31,396 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2025-01-10 01:00:31,396 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 455 flow [2025-01-10 01:00:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 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) [2025-01-10 01:00:31,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:31,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:00:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash 143547361, now seen corresponding path program 1 times [2025-01-10 01:00:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:31,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136233086] [2025-01-10 01:00:31,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:31,600 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:31,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:00:31,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:00:31,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:00:31,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:00:31,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:00:32,164 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-01-10 01:00:32,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2025-01-10 01:00:32,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-01-10 01:00:32,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-01-10 01:00:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-01-10 01:00:32,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2025-01-10 01:00:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:32,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:32,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_570) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2025-01-10 01:00:32,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32)) (v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_567) (select (select (store |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_570) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))) is different from false [2025-01-10 01:00:32,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:32,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-10 01:00:32,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:32,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 57 [2025-01-10 01:00:32,606 INFO L378 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 21 treesize of output 14 [2025-01-10 01:00:34,258 INFO L349 Elim1Store]: treesize reduction 7, result has 96.7 percent of original size [2025-01-10 01:00:34,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 290 [2025-01-10 01:00:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:34,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136233086] [2025-01-10 01:00:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136233086] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:34,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:00:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2025-01-10 01:00:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388160910] [2025-01-10 01:00:34,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:34,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:00:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:34,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:00:34,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=285, Unknown=6, NotChecked=70, Total=420 [2025-01-10 01:00:35,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 133 [2025-01-10 01:00:35,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 455 flow. Second operand has 21 states, 21 states have (on average 31.80952380952381) internal successors, (668), 21 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:35,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:35,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 133 [2025-01-10 01:00:35,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:38,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-10 01:00:40,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-10 01:00:40,512 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_new_~p~0#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base|) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_570) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))))))) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32)) (v_ArrVal_567 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_567))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_new_~p~0#1.base|))) (= (bvadd (_ bv1 1) (select .cse0 v_arrayElimCell_29)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))))) (forall ((|~#c~0.base| (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))))) (forall ((|~#c~0.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_567 (_ BitVec 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_567) |c_ULTIMATE.start_new_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))))))) is different from false [2025-01-10 01:00:40,554 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_570) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))))))) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32)) (v_ArrVal_567 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_567))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_new_~p~0#1.base|))) (= (bvadd (_ bv1 1) (select .cse0 v_arrayElimCell_29)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))))) (forall ((|~#c~0.base| (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))))) (forall ((|~#c~0.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_567 (_ BitVec 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_567) |c_ULTIMATE.start_new_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))))))) is different from false [2025-01-10 01:00:43,102 INFO L124 PetriNetUnfolderBase]: 329/1037 cut-off events. [2025-01-10 01:00:43,102 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-10 01:00:43,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1037 events. 329/1037 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6103 event pairs, 292 based on Foata normal form. 6/805 useless extension candidates. Maximal degree in co-relation 1946. Up to 675 conditions per place. [2025-01-10 01:00:43,109 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 83 selfloop transitions, 32 changer transitions 0/145 dead transitions. [2025-01-10 01:00:43,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 145 transitions, 767 flow [2025-01-10 01:00:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:00:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:00:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 831 transitions. [2025-01-10 01:00:43,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26033834586466165 [2025-01-10 01:00:43,113 INFO L175 Difference]: Start difference. First operand has 135 places, 122 transitions, 455 flow. Second operand 24 states and 831 transitions. [2025-01-10 01:00:43,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 145 transitions, 767 flow [2025-01-10 01:00:43,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 145 transitions, 751 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:43,117 INFO L231 Difference]: Finished difference. Result has 161 places, 132 transitions, 569 flow [2025-01-10 01:00:43,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=569, PETRI_PLACES=161, PETRI_TRANSITIONS=132} [2025-01-10 01:00:43,118 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2025-01-10 01:00:43,118 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 132 transitions, 569 flow [2025-01-10 01:00:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 31.80952380952381) internal successors, (668), 21 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:43,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:43,119 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:43,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:43,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:00:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 143547362, now seen corresponding path program 1 times [2025-01-10 01:00:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:00:43,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366353664] [2025-01-10 01:00:43,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:43,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:43,324 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:43,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:00:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:00:43,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:00:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:43,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 01:00:43,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:43,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:00:43,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:00:43,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:00:44,034 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2025-01-10 01:00:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2025-01-10 01:00:44,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:00:44,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-01-10 01:00:44,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-01-10 01:00:44,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:44,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-01-10 01:00:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:00:44,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2025-01-10 01:00:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:44,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:44,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_677) |c_~#c~0.base|) .cse1)))))) is different from false [2025-01-10 01:00:44,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_677) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2025-01-10 01:00:44,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_47| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_47|))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_678) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_47| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_47|))) (forall ((v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_678) |c_~#c~0.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_672) (select (select (store |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_677) |c_~#c~0.base|) .cse1)))))))) is different from false [2025-01-10 01:00:44,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2025-01-10 01:00:44,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2025-01-10 01:00:44,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 81 [2025-01-10 01:00:44,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 118 [2025-01-10 01:00:44,444 INFO L378 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 28 treesize of output 21 [2025-01-10 01:00:44,452 INFO L378 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 21 treesize of output 14 [2025-01-10 01:00:44,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2025-01-10 01:00:44,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:00:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2025-01-10 01:00:44,969 INFO L378 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 25 treesize of output 11 [2025-01-10 01:00:47,617 INFO L349 Elim1Store]: treesize reduction 10, result has 90.1 percent of original size [2025-01-10 01:00:47,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 156 [2025-01-10 01:00:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-10 01:00:49,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:00:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366353664] [2025-01-10 01:00:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366353664] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:49,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:00:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2025-01-10 01:00:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175631052] [2025-01-10 01:00:49,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:00:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:00:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:00:49,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2025-01-10 01:00:49,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2025-01-10 01:00:49,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 132 transitions, 569 flow. Second operand has 23 states, 23 states have (on average 21.652173913043477) internal successors, (498), 23 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:49,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:49,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2025-01-10 01:00:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:55,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (let ((.cse1 (bvule .cse4 (select |c_#length| |c_ULTIMATE.start_new_~p~0#1.base|))) (.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse3 (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse4))) (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_677) |c_~#c~0.base|) .cse0)))) (forall ((v_prenex_5 (_ BitVec 32))) (or (= v_prenex_5 |c_ULTIMATE.start_new_~p~0#1.base|) .cse1)) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_672 (_ BitVec 32))) (or (bvule (bvadd (_ bv8 32) v_arrayElimCell_53) (select (store |c_#length| v_prenex_4 v_ArrVal_672) v_arrayElimCell_52)) (= v_prenex_4 |c_ULTIMATE.start_new_~p~0#1.base|) .cse1)) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (or (forall ((|~#c~0.base| (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|))))) (and (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_47| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_47|)))) .cse3) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_47| (_ BitVec 32))) (or (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_672 (_ BitVec 32))) (let ((.cse5 (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_672))) (or (bvule .cse4 (select .cse5 |c_ULTIMATE.start_new_~p~0#1.base|)) (bvule (bvadd (_ bv8 32) v_arrayElimCell_53) (select .cse5 v_arrayElimCell_52))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_47|))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_47| (_ BitVec 32))) (or (forall ((v_ArrVal_672 (_ BitVec 32))) (bvule .cse4 (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_47| v_ArrVal_672) |c_ULTIMATE.start_new_~p~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_47|))))))) .cse3))) is different from false [2025-01-10 01:00:55,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse2 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_678) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_677) |c_~#c~0.base|) .cse1)))) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_672 (_ BitVec 32))) (let ((.cse3 (store |c_#length| v_prenex_4 v_ArrVal_672))) (or (bvule .cse2 (select .cse3 |c_ULTIMATE.start_new_~p~0#1.base|)) (= v_prenex_4 |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base|) (bvule (bvadd (_ bv8 32) v_arrayElimCell_53) (select .cse3 v_arrayElimCell_52))))) (forall ((v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (or (bvule .cse2 (select (store |c_#length| v_prenex_5 v_prenex_6) |c_ULTIMATE.start_new_~p~0#1.base|)) (= v_prenex_5 |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base|))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse2))) is different from false [2025-01-10 01:01:03,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:01:04,647 INFO L124 PetriNetUnfolderBase]: 465/1259 cut-off events. [2025-01-10 01:01:04,647 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-01-10 01:01:04,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 1259 events. 465/1259 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7500 event pairs, 422 based on Foata normal form. 6/838 useless extension candidates. Maximal degree in co-relation 2495. Up to 951 conditions per place. [2025-01-10 01:01:04,655 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 86 selfloop transitions, 34 changer transitions 0/140 dead transitions. [2025-01-10 01:01:04,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 140 transitions, 835 flow [2025-01-10 01:01:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:01:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 01:01:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 615 transitions. [2025-01-10 01:01:04,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1849624060150376 [2025-01-10 01:01:04,658 INFO L175 Difference]: Start difference. First operand has 161 places, 132 transitions, 569 flow. Second operand 25 states and 615 transitions. [2025-01-10 01:01:04,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 140 transitions, 835 flow [2025-01-10 01:01:04,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 140 transitions, 741 flow, removed 18 selfloop flow, removed 15 redundant places. [2025-01-10 01:01:04,664 INFO L231 Difference]: Finished difference. Result has 172 places, 134 transitions, 563 flow [2025-01-10 01:01:04,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=563, PETRI_PLACES=172, PETRI_TRANSITIONS=134} [2025-01-10 01:01:04,665 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 54 predicate places. [2025-01-10 01:01:04,665 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 134 transitions, 563 flow [2025-01-10 01:01:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 21.652173913043477) internal successors, (498), 23 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:04,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:04,666 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:04,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:01:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:04,866 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:01:04,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1620536514, now seen corresponding path program 1 times [2025-01-10 01:01:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:01:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197330221] [2025-01-10 01:01:04,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:04,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:04,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:04,870 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:04,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:01:05,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:01:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:01:05,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:05,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:05,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:01:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 01:01:05,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 01:01:05,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:01:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197330221] [2025-01-10 01:01:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197330221] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:05,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:05,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 01:01:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398649019] [2025-01-10 01:01:05,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:05,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:01:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:01:05,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:01:05,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:01:05,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2025-01-10 01:01:05,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 134 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 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) [2025-01-10 01:01:05,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:05,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2025-01-10 01:01:05,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:06,294 INFO L124 PetriNetUnfolderBase]: 124/685 cut-off events. [2025-01-10 01:01:06,294 INFO L125 PetriNetUnfolderBase]: For 328/329 co-relation queries the response was YES. [2025-01-10 01:01:06,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 685 events. 124/685 cut-off events. For 328/329 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2723 event pairs, 100 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1447. Up to 250 conditions per place. [2025-01-10 01:01:06,297 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 94 selfloop transitions, 6 changer transitions 0/167 dead transitions. [2025-01-10 01:01:06,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 167 transitions, 1040 flow [2025-01-10 01:01:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2025-01-10 01:01:06,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6679197994987469 [2025-01-10 01:01:06,299 INFO L175 Difference]: Start difference. First operand has 172 places, 134 transitions, 563 flow. Second operand 6 states and 533 transitions. [2025-01-10 01:01:06,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 167 transitions, 1040 flow [2025-01-10 01:01:06,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 167 transitions, 932 flow, removed 2 selfloop flow, removed 21 redundant places. [2025-01-10 01:01:06,304 INFO L231 Difference]: Finished difference. Result has 160 places, 137 transitions, 556 flow [2025-01-10 01:01:06,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=556, PETRI_PLACES=160, PETRI_TRANSITIONS=137} [2025-01-10 01:01:06,305 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 42 predicate places. [2025-01-10 01:01:06,305 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 137 transitions, 556 flow [2025-01-10 01:01:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 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) [2025-01-10 01:01:06,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:06,305 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-01-10 01:01:06,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:01:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:06,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:01:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1620536551, now seen corresponding path program 2 times [2025-01-10 01:01:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:01:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143309403] [2025-01-10 01:01:06,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:06,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:06,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:06,514 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:06,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:01:06,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-10 01:01:06,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:01:06,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:07,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:01:07,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:07,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:07,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:01:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143309403] [2025-01-10 01:01:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143309403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:07,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-10 01:01:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252786505] [2025-01-10 01:01:07,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:07,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:01:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:01:07,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:01:07,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:01:07,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2025-01-10 01:01:07,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 137 transitions, 556 flow. Second operand has 12 states, 12 states have (on average 80.91666666666667) internal successors, (971), 12 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:07,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:07,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2025-01-10 01:01:07,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:08,950 INFO L124 PetriNetUnfolderBase]: 124/937 cut-off events. [2025-01-10 01:01:08,950 INFO L125 PetriNetUnfolderBase]: For 842/843 co-relation queries the response was YES. [2025-01-10 01:01:08,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 937 events. 124/937 cut-off events. For 842/843 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2779 event pairs, 100 based on Foata normal form. 24/855 useless extension candidates. Maximal degree in co-relation 2152. Up to 263 conditions per place. [2025-01-10 01:01:08,953 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 122 selfloop transitions, 24 changer transitions 0/213 dead transitions. [2025-01-10 01:01:08,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 1316 flow [2025-01-10 01:01:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:01:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:01:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1019 transitions. [2025-01-10 01:01:08,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384711779448622 [2025-01-10 01:01:08,955 INFO L175 Difference]: Start difference. First operand has 160 places, 137 transitions, 556 flow. Second operand 12 states and 1019 transitions. [2025-01-10 01:01:08,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 1316 flow [2025-01-10 01:01:08,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 213 transitions, 1314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:08,962 INFO L231 Difference]: Finished difference. Result has 177 places, 151 transitions, 832 flow [2025-01-10 01:01:08,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=832, PETRI_PLACES=177, PETRI_TRANSITIONS=151} [2025-01-10 01:01:08,963 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 59 predicate places. [2025-01-10 01:01:08,963 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 151 transitions, 832 flow [2025-01-10 01:01:08,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.91666666666667) internal successors, (971), 12 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:08,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:08,964 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2025-01-10 01:01:08,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:01:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:09,164 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-01-10 01:01:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1031168921, now seen corresponding path program 3 times [2025-01-10 01:01:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:01:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975664306] [2025-01-10 01:01:09,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:01:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:09,169 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:01:09,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 12 equivalence classes.